The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A049958 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), starting with a(1) = 1, a(2) = 2, and a(3) = 3. 3

%I

%S 1,2,3,7,15,29,59,119,242,478,957,1915,3834,7676,15366,30762,61584,

%T 123050,246101,492203,984410,1968828,3937670,7875370,15750800,

%U 31501723,63003682,126007843,252016644,504035207,1008074256,2016156202

%N 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), starting with a(1) = 1, a(2) = 2, and a(3) = 3.

%p s := proc(n) option remember; `if`(n < 1, 0, a(n) + s(n - 1)); end proc;

%p a := proc(n) option remember; `if`(n < 4, [1, 2, 3][n], s(n - 1) + a(-2^ceil(log[2](n - 1) - 1) + n - 1)); end proc;

%p seq(a(n), n = 1 .. 40); # _Petros Hadjicostas_, Apr 23 2020

%Y Cf. A049910 (similar with minus a(m)), A049911 (similar with minus a(2*m)), A049959 (similar with plus a(2*m)).

%K nonn

%O 1,2

%A _Clark Kimberling_

%E Name edited by _Petros Hadjicostas_, Apr 23 2020

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.

Last modified December 8 20:31 EST 2021. Contains 349596 sequences. (Running on oeis4.)