|
Search: id:A123090
|
|
|
| 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). |
|
+0
2
|
|
| 1, 2, 3, 5, 10, 13, 14, 16, 19, 29, 30, 33, 46, 60, 65, 81, 82, 85, 104, 114, 117, 119, 120, 123, 128, 141, 144, 158, 187, 217, 218, 234, 267, 269, 274, 277, 278, 297, 310, 320, 321, 335, 336, 338, 343, 389, 390, 406, 407, 417, 420, 433, 434, 437, 442, 456, 475
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
The largest divisor of 9 which occurs among the first 8 terms of the sequence is 3. So a(9) = a(8) + 3 = 19.
|
|
MATHEMATICA
|
f[l_List] := Block[{n = Length[l] + 1}, Append[l, Last[l] + Max[Select[l, Mod[n, # ] == 0 &]]]]; Nest[f, {1}, 60] (*Chandler*)
|
|
CROSSREFS
|
Sequence in context: A079251 A050051 A083571 this_sequence A129281 A022426 A005677
Adjacent sequences: A123087 A123088 A123089 this_sequence A123091 A123092 A123093
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Sep 27 2006
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Sep 30 2006
|
|
|
Search completed in 0.002 seconds
|
