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!)
A049953 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1 and a(2) = a(3) = 2. 0
1, 2, 2, 7, 13, 32, 59, 118, 235, 587, 1115, 2203, 4387, 8768, 17531, 35062, 70123, 175307, 333083, 657403, 1310425, 2618666, 5236244, 10471960, 20943568, 41887019, 83773979, 167547931, 335095843, 670191680, 1340383355, 2680766710, 5361533419, 13403833547, 25467283739, 50264375803 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

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, 2][n], s(n - 1) + a(2^ceil(log[2](n - 1)) + 2 - n)):

end proc:

seq(a(n), n = 1..34); # Petros Hadjicostas, Nov 13 2019

CROSSREFS

Sequence in context: A047767 A303588 A019144 * A156435 A344048 A228432

Adjacent sequences:  A049950 A049951 A049952 * A049954 A049955 A049956

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Name edited by and more terms from Petros Hadjicostas, Nov 13 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 October 27 06:31 EDT 2021. Contains 348271 sequences. (Running on oeis4.)