|
Search: id:A122077
|
|
|
| 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
|
|
| 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
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
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] (*Chandler*)
|
|
CROSSREFS
|
Sequence in context: A047541 A120749 A138830 this_sequence A029924 A125883 A022848
Adjacent sequences: A122074 A122075 A122076 this_sequence A122078 A122079 A122080
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Oct 16 2006
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Oct 16 2006
|
|
|
Search completed in 0.002 seconds
|
