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!)
A049927 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) = 3. 0
1, 3, 3, 4, 7, 15, 29, 47, 62, 168, 335, 659, 1286, 2451, 4411, 7030, 9481, 25989, 51977, 103943, 207854, 415587, 830683, 1659574, 3314569, 6610179, 13142404, 25973164, 50702341, 96454077, 173545169, 276609425, 373063502, 1022736426 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

PROG

(PARI) lista(nn) = { my(va = vector(nn)); va[1] = 1; va[2] = 3; va[3] = 3; my(sa = vecsum(va)); for (n=4, nn, va[n] = sa - va[2*n - 2 - 2^ceil(log(n-1)/log(2))]; sa += va[n]; ); va; } \\ Petros Hadjicostas, Apr 26 2020

CROSSREFS

Sequence in context: A205116 A011959 A246023 * A329216 A266616 A340429

Adjacent sequences:  A049924 A049925 A049926 * A049928 A049929 A049930

KEYWORD

nonn

AUTHOR

Clark Kimberling

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 January 24 13:48 EST 2022. Contains 350538 sequences. (Running on oeis4.)