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!)
A049949 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, a(2) = 2, and a(3) = 1. 0
1, 2, 1, 6, 11, 27, 49, 99, 197, 492, 934, 1846, 3676, 7347, 14689, 29379, 58757, 146892, 279094, 550846, 1098021, 2194212, 4387512, 8774582, 17548869, 35097640, 70195230, 140390438, 280780860, 561561715, 1123123425, 2246246851 (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)) + 2 - n)):

end proc:

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

CROSSREFS

Cf. A006257, A049933, A049937, A049945.

Sequence in context: A039762 A039795 A283746 * A106192 A113025 A113216

Adjacent sequences:  A049946 A049947 A049948 * A049950 A049951 A049952

KEYWORD

nonn

AUTHOR

Clark Kimberling

EXTENSIONS

Name edited by Petros Hadjicostas, Nov 12 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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 22 12:28 EDT 2022. Contains 353950 sequences. (Running on oeis4.)