# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a123090
Showing 1-1 of 1

%I A123090 #12 Oct 11 2019 12:36:19
%S A123090 1,2,3,5,10,13,14,16,19,29,30,33,46,60,65,81,82,85,104,114,117,119,
%T A123090 120,123,128,141,144,158,187,217,218,234,267,269,274,277,278,297,310,
%U A123090 320,321,335,336,338,343,389,390,406,407,417,420,433,434,437,442,456,475
%N A123090 a(1)=1. For n>=2, a(n) = a(n-1) + (largest divisor of n which occurs among the earlier terms of the sequence).
%H A123090 Ivan Neretin, <a href="/A123090/b123090.txt">Table of n, a(n) for n = 1..10000</a>
%e A123090 The largest divisor of 9 which occurs among the first 8 terms of the sequence is 3. So a(9) = a(8) + 3 = 19.
%t A123090 f[l_List] := Block[{n = Length[l] + 1},Append[l, Last[l] + Max[Select[l, Mod[n, # ] == 0 &]]]];Nest[f, {1}, 60] (* _Ray Chandler_, Sep 30 2006 *)
%K A123090 nonn
%O A123090 1,2
%A A123090 _Leroy Quet_, Sep 27 2006
%E A123090 Extended by _Ray Chandler_, Sep 30 2006

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE