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!)
A049956 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3. 0
1, 2, 3, 7, 16, 30, 62, 137, 320, 579, 1160, 2333, 4712, 9682, 20204, 43960, 103412, 186621, 373244, 746501, 1493048, 2986354, 5973548, 11950648, 23916788, 47916784, 96103400, 193326604, 391133708, 800210656, 1672607924 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..31.

MAPLE

s := proc(n) option remember; `if`(n < 1, 0, a(n) + s(n - 1)) end proc:

a := proc(n) option remember; `if`(n < 4, [1, 2, 3][n],

       s(n - 1) + a(-2^ceil(log[2](n - 1)) + 2*n - 3))

     end proc:

seq(a(n), n = 1..40); # Petros Hadjicostas, Nov 15 2019

CROSSREFS

Sequence in context: A058699 A250193 A004782 * A289844 A153056 A235112

Adjacent sequences:  A049953 A049954 A049955 * A049957 A049958 A049959

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Name edited by Petros Hadjicostas, Nov 15 2019

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 September 26 13:25 EDT 2021. Contains 347668 sequences. (Running on oeis4.)