|
Search: id:A126022
|
|
|
| A126022 |
|
a(1)=1; for n>1, a(n) = a(n-1) + (the number of terms of {a(k)} which are <= n). |
|
+0
3
|
|
| 1, 2, 4, 7, 10, 13, 17, 21, 25, 30, 35, 40, 46, 52, 58, 64, 71, 78, 85, 92, 100, 108, 116, 124, 133, 142, 151, 160, 169, 179, 189, 199, 209, 219, 230, 241, 252, 263, 274, 286, 298, 310, 322, 334, 346, 359, 372, 385, 398, 411, 424, 438, 452, 466, 480, 494, 508
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
Leroy Quet, Home Page (listed in lieu of email address)
|
|
EXAMPLE
|
There are four terms (1,2,4,7) of the sequence which are <= 9. So a(9) = a(8) + 4 = 25.
|
|
MATHEMATICA
|
f[l_] := Block[{s = Length@l + 2}, Append[l, Last@l + Length@Select[l, # < s &]]]; Nest[f, {1}, 56] - Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 01 2007
|
|
CROSSREFS
|
Sequence in context: A003067 A130243 A061465 this_sequence A049983 A151986 A101472
Adjacent sequences: A126019 A126020 A126021 this_sequence A126023 A126024 A126025
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Leroy Quet Feb 27 2007
|
|
EXTENSIONS
|
More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Mar 01 2007
|
|
|
Search completed in 0.002 seconds
|
