login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A050071 a(n) = a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4. 11
1, 3, 4, 7, 14, 17, 24, 41, 82, 85, 92, 109, 150, 235, 344, 579, 1158, 1161, 1168, 1185, 1226, 1311, 1420, 1655, 2234, 3395, 4580, 5891, 7546, 10941, 16832, 27773, 55546, 55549, 55556, 55573, 55614, 55699, 55808, 56043, 56622 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Ivan Neretin, Table of n, a(n) for n = 1..8193

MATHEMATICA

Fold[Append[#1, #1[[-1]] + #1[[#2]]] &, {1, 3, 4}, Flatten@Table[2 k, {n, 5}, {k, 2^n}]] (* Ivan Neretin, Sep 07 2015 *)

CROSSREFS

Cf. A050027, A050031, A050035, A050039, A050043, A050047, A050051, A050055, A050059, A050063, A050067 (similar, but with different initial conditions).

Sequence in context: A250297 A254310 A121174 * A041002 A062203 A319548

Adjacent sequences:  A050068 A050069 A050070 * A050072 A050073 A050074

KEYWORD

nonn

AUTHOR

Clark Kimberling

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 12 05:30 EDT 2021. Contains 343812 sequences. (Running on oeis4.)