The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049947 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) = a(2) = 1 and a(3) = 4. 0
 1, 1, 4, 7, 20, 34, 74, 175, 491, 808, 1622, 3271, 6683, 13999, 30461, 71650, 200951, 330253, 660512, 1321051, 2642243, 5285119, 10572701, 21156130, 42369911, 84998425, 170987648, 345939364, 707749739, 1479341773, 3219624485 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,3 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, 1, 4][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 25 2020 CROSSREFS Sequence in context: A090879 A084404 A147065 * A266822 A296624 A296663 Adjacent sequences: A049944 A049945 A049946 * A049948 A049949 A049950 KEYWORD nonn AUTHOR Clark Kimberling EXTENSIONS Name edited by Petros Hadjicostas, Apr 25 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.

Last modified May 27 11:27 EDT 2024. Contains 372858 sequences. (Running on oeis4.)