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!)
A049931 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, a(2) = 3, and a(3) = 4. 0
1, 3, 4, 5, 8, 18, 34, 55, 73, 198, 394, 775, 1513, 2883, 5189, 8270, 11153, 30573, 61144, 122275, 244513, 488883, 977189, 1952270, 3899153, 7776003, 15460304, 30554000, 59644613, 113465493, 204152989, 325394485, 438859978 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

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

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, 3, 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: A219038 A258454 A176776 * A335436 A058983 A261208

Adjacent sequences:  A049928 A049929 A049930 * A049932 A049933 A049934

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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 19 11:05 EST 2022. Contains 350464 sequences. (Running on oeis4.)