login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the 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)).
0
1, 2, 4, 7, 9, 11, 13, 15, 17, 19, 21, 24, 28, 33, 36, 41, 43, 45, 49, 52, 57, 60, 65, 68, 73, 75, 78, 82, 86, 90, 96, 101, 103, 105, 110, 114, 119, 123, 126, 132, 138, 141, 143, 147, 152, 157, 159, 161, 164, 170, 174, 177, 179, 181, 183, 185, 187, 191, 193, 195, 200
OFFSET
1,2
EXAMPLE
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.
MATHEMATICA
f[l_List] := Append[l, l[[ -1]] + Count[ Mod[l[[ -1]], l], 0]]; Nest[f, {1}, 65] (* Ray Chandler, Oct 16 2006 *)
CROSSREFS
Sequence in context: A190193 A353737 A138830 * A029924 A125883 A022848
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Oct 16 2006
EXTENSIONS
Extended by Ray Chandler, Oct 16 2006
STATUS
approved