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!)
A049955 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = 2*n - 2 - 2^(p+1) 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. 3
1, 2, 2, 7, 19, 33, 71, 168, 471, 776, 1557, 3140, 6415, 13438, 29240, 68778, 192896, 317016, 634037, 1268100, 2536335, 5073278, 10148920, 20308138, 40671616, 81591470, 164134024, 332073226, 679381312, 1420045956, 3090573668 (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, 2][n], s(n - 1) + a(-2^ceil(log[2](n - 1)) + 2*n - 2)); end proc:

seq(a(n), n = 1 .. 40); # Petros Hadjicostas, Apr 23 2020

CROSSREFS

Cf. A049906 (similar with minus a(m/2)), A049907 (similar with minus a(m)), A049954 (similar with plus a(m/2)).

Sequence in context: A203579 A338415 A243022 * A184714 A156464 A156520

Adjacent sequences:  A049952 A049953 A049954 * A049956 A049957 A049958

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Name edited by Petros Hadjicostas, Apr 23 2020

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 25 03:28 EDT 2021. Contains 348237 sequences. (Running on oeis4.)