A122077 - OEIS

A122077

a(1)=1. a(n) = a(n-1) + (the number of earlier terms which divide a(n-1) (including a(n-1) itself)).

%I #13 Nov 01 2019 12:51:21

%S 1,2,4,7,9,11,13,15,17,19,21,24,28,33,36,41,43,45,49,52,57,60,65,68,

%T 73,75,78,82,86,90,96,101,103,105,110,114,119,123,126,132,138,141,143,

%U 147,152,157,159,161,164,170,174,177,179,181,183,185,187,191,193,195,200

%N a(1)=1. a(n) = a(n-1) + (the number of earlier terms which divide a(n-1) (including a(n-1) itself)).

%e From among the first 13 terms, five terms (a(1)=1, a(2)=2, a(3)=4, a(4)=7 and a(13)=28) divide a(13)=28. So a(14)= a(13)+ 5 = 33.

%t f[l_List] := Append[l, l[[ -1]] + Count[ Mod[l[[ -1]], l], 0]];Nest[f, {1}, 65] (* _Ray Chandler_, Oct 16 2006 *)

%K easy,nonn

%O 1,2

%A _Leroy Quet_, Oct 16 2006

%E Extended by _Ray Chandler_, Oct 16 2006