|
Search: id:A126698
|
|
|
| A126698 |
|
a(0)=1. For n>=1, a(n) = a(n-1) + (largest divisor of n which does not occur among the earlier terms of the sequence); or a(n) = a(n-1) if every divisor of n occurs among the earlier terms of the sequence. |
|
+0
1
|
|
| 1, 1, 3, 3, 7, 12, 18, 18, 26, 35, 45, 56, 62, 75, 89, 104, 120, 137, 146, 165, 185, 206, 228, 251, 275, 300, 313, 340, 368, 397, 427, 458, 490, 523, 557, 562, 598, 635, 673, 712, 752, 793, 835, 878, 922, 937, 983, 1030, 1078, 1127, 1177, 1228, 1280, 1333
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
MATHEMATICA
|
f[l_List] := Block[{c}, c = Complement[Divisors[Length[l]], l]; Append[l, l[[ -1]] + If[c == {}, 0, Max @@ c]]]; Nest[f, {1}, 55] (*Chandler*)
|
|
CROSSREFS
|
Sequence in context: A161815 A006661 A068626 this_sequence A088859 A116880 A051123
Adjacent sequences: A126695 A126696 A126697 this_sequence A126699 A126700 A126701
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Leroy Quet Feb 15 2007
|
|
EXTENSIONS
|
Extended by Ray Chandler (rayjchandler(AT)sbcglobal.net), Feb 19 2007
|
|
|
Search completed in 0.002 seconds
|
