The OEIS is supported by the many generous donors to the OEIS Foundation.

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049888 a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2*n - 3 - 2^(p+1) and p is the unique integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = a(2) = 1 and a(3) = 2. 0
 1, 1, 2, 3, 5, 11, 21, 39, 62, 144, 287, 571, 1126, 2211, 4197, 7555, 12039, 28274, 56547, 113091, 226166, 452291, 904357, 1807875, 3612679, 7217516, 14390524, 28611429, 56544667, 110381012, 209984179, 377814215, 602188918 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 LINKS 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, 1, 2][n], s(n - 1) - a(-2^ceil(log[2](n - 1)) + 2*n - 3)): end proc: seq(a(n), n = 1..40); # Petros Hadjicostas, Nov 15 2019 CROSSREFS Sequence in context: A155954 A337347 A087581 * A117221 A073879 A073880 Adjacent sequences: A049885 A049886 A049887 * A049889 A049890 A049891 KEYWORD nonn AUTHOR EXTENSIONS Name edited by Petros Hadjicostas, Nov 15 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.

Last modified December 1 14:21 EST 2022. Contains 358468 sequences. (Running on oeis4.)