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!)
A049950 a(n) = a(1) + a(2) + ... + a(n-1) + a(m) for n >= 4, where m = n - 1 - 2^p and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), with a(1) = 1, a(2) = 2, and a(3) = 1. 0
1, 2, 1, 5, 11, 21, 43, 85, 174, 344, 689, 1377, 2758, 5522, 11054, 22130, 44302, 88520, 177041, 354081, 708166, 1416338, 2832686, 5665394, 11330830, 22661749, 45323668, 90647681, 181296050, 362593481, 725189726, 1450384984 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

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

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

CROSSREFS

Sequence in context: A110352 A107310 A277279 * A095216 A307258 A174317

Adjacent sequences:  A049947 A049948 A049949 * A049951 A049952 A049953

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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 19:59 EDT 2022. Contains 353957 sequences. (Running on oeis4.)