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!)
A306622 a(1) = 1, for n >= 2, a(n) = Sum_{i=1..floor(log_2(n))} a(n-i). 1
1, 1, 1, 2, 3, 5, 8, 16, 29, 53, 98, 180, 331, 609, 1120, 2240, 4300, 8269, 15929, 30738, 59236, 114172, 220075, 424221, 817704, 1576172, 3038172, 5856269, 11288317, 21758930, 41941688, 83883376, 164728580, 323600891, 635913465, 1250068000, 2458194312, 4832505248, 9500281916 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
FORMULA
For n >= 2 a(2^n) = 2*a((2^n)-1).
EXAMPLE
n = 7, floor(log_2(7)) = 2, a(7) = a(7-1) + a(7-2) = a(6) + a(5).
MATHEMATICA
a[1] = 1; a[n_] := a[n] = Total@ Map[a[n - #] &, Range[Floor@ Log2[n]]]; Array[a, 39] (* Michael De Vlieger, Mar 16 2022 *)
PROG
(PARI) lista(nn) = {my(va = vector(nn)); va[1] = 1; for (n=2, nn, va[n] = sum(i=1, log(n)\log(2), va[n-i]); ); va; } \\ Michel Marcus, Mar 04 2019
CROSSREFS
Cf. A000523.
Sequence in context: A192645 A050295 A121649 * A030034 A370002 A308852
KEYWORD
nonn
AUTHOR
Ctibor O. Zizka, Mar 01 2019
EXTENSIONS
More terms from Michel Marcus, Mar 16 2022
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 September 16 14:29 EDT 2024. Contains 375976 sequences. (Running on oeis4.)