login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A126022 a(1)=1; for n>1, a(n) = a(n-1) + (the number of terms of {a(k)} which are <= n). 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; refs; listen; history; text; internal format)
OFFSET
1,2
LINKS
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, Mar 01 2007 *)
CROSSREFS
Sequence in context: A130243 A061465 A368784 * A194172 A173537 A049983
KEYWORD
easy,nonn
AUTHOR
Leroy Quet, Feb 27 2007
EXTENSIONS
More terms from Robert G. Wilson v, Mar 01 2007
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 1 19:22 EDT 2024. Contains 374817 sequences. (Running on oeis4.)