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!)
A306777 a(0)=0, a(1)=1, a(n) = a(n-1) + sum(a(floor(n/d)), d=2^x, x=1...n). 0
0, 1, 2, 3, 6, 9, 13, 17, 26, 35, 47, 59, 76, 93, 114, 135, 170, 205, 249, 293, 352, 411, 482, 553, 646, 739, 849, 959, 1094, 1229, 1385, 1541, 1746, 1951, 2191, 2431, 2724, 3017, 3354, 3691, 4102, 4513, 4983, 5453, 6006, 6559, 7183, 7807, 8546, 9285, 10117, 10949 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
LINKS
EXAMPLE
a(18) = a(17) + a(9) + a(4) + a(2) + a(1) = 205 + 35 + 6 + 2 + 1 = 205.
PROG
(Python)
a = [0]*1000
a[1] = 1
for n in range(2, len(a)):
a[n] = a[n-1]
d = 2
while d <= n:
a[n] += a[n//d]
d *= 2
print(a)
CROSSREFS
Sequence in context: A248187 A190772 A130673 * A062891 A018599 A325340
KEYWORD
nonn
AUTHOR
Alex Ratushnyak, Mar 11 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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 18:16 EDT 2024. Contains 371916 sequences. (Running on oeis4.)