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!)
A369222 Number of compositions (ordered partitions) of n into powers of 2 not greater than sqrt(n). 1

%I #13 Jan 22 2024 18:20:10

%S 1,1,1,1,5,8,13,21,34,55,89,144,233,377,610,987,4930,8651,15182,26642,

%T 46754,82047,143983,252672,443409,778128,1365520,2396320,4205249,

%U 7379697,12950466,22726483,39882198,69988378,122821042,215535903,378239143,663763424

%N Number of compositions (ordered partitions) of n into powers of 2 not greater than sqrt(n).

%H Alois P. Heinz, <a href="/A369222/b369222.txt">Table of n, a(n) for n = 0..4048</a>

%p b:= proc(n, t) option remember; `if`(n=0, 1,

%p add(b(n-2^j, t), j=0..min(ilog2(n), t)))

%p end:

%p a:= n-> b(n, ilog2(floor(sqrt(n)))):

%p seq(a(n), n=0..37); # _Alois P. Heinz_, Jan 18 2024

%t Table[SeriesCoefficient[1/(1 - Sum[Boole[IntegerQ[Log[2, k]]] x^k, {k, 1, Floor[Sqrt[n]]}]), {x, 0, n}], {n, 0, 37}]

%Y Cf. A000045, A023359, A109696, A364526.

%K nonn

%O 0,5

%A _Ilya Gutkovskiy_, Jan 16 2024

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 3 07:27 EDT 2024. Contains 375649 sequences. (Running on oeis4.)