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!)
A094589 a(1) = 1; a(n+1) = a(n) + (largest element of {a} <= n). 8
1, 2, 4, 6, 10, 14, 20, 26, 32, 38, 48, 58, 68, 78, 92, 106, 120, 134, 148, 162, 182, 202, 222, 242, 262, 282, 308, 334, 360, 386, 412, 438, 470, 502, 534, 566, 598, 630, 668, 706, 744, 782, 820, 858, 896, 934, 972, 1010, 1058, 1106, 1154, 1202, 1250, 1298 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
a(n+1) = a(n) + a(k(n)), where k(n) is the number of elements of {a} which are <= n.
LINKS
MATHEMATICA
f[n_] := Block[{t = Table[0, {n}]}, t[[1]] = 1; For[i = 1, i < n, i++, t[[i + 1]] = t[[i]] + t[[Count[t, x_ /; 0 < x <= i]]]]; t]; f@ 54 (* Michael De Vlieger, Mar 23 2015 *)
PROG
(PARI) flargest(va, n) = {vsa = vecsort(va, , 12); for (k=1, #vsa, if (vsa[k] < n, return (vsa[k])); ); }
lista(nn) = {va = [1]; print1(va[1], ", "); for (n=2, nn, newa = flargest(va, n) + va[n-1]; print1(newa, ", "); va = concat(va, newa); ); } \\ Michel Marcus, Mar 23 2015
CROSSREFS
Cf. A094590, A250983 (first differences).
Sequence in context: A167379 A213476 A277085 * A071425 A115065 A333574
KEYWORD
nonn,easy
AUTHOR
Leroy Quet, Jun 07 2004
EXTENSIONS
More terms from Vladeta Jovovic, Jun 13 2004
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 April 25 11:24 EDT 2024. Contains 371967 sequences. (Running on oeis4.)