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!)
A342230 Total number of parts which are powers of 2 in all partitions of n. 1

%I #6 Mar 07 2021 03:56:09

%S 0,1,3,5,11,17,29,44,71,102,153,216,311,429,599,810,1108,1475,1974,

%T 2595,3421,4441,5776,7422,9542,12147,15459,19513,24617,30838,38590,

%U 48012,59662,73754,91056,111916,137357,167922,204982,249349,302873,366732,443390,534573

%N Total number of parts which are powers of 2 in all partitions of n.

%F G.f.: Sum_{k>=0} x^(2^k)/(1 - x^(2^k)) / Product_{j>=1} (1 - x^j).

%F a(n) = Sum_{k=1..n} A001511(k) * A000041(n-k).

%F a(n) = A000070(n-1) + A073119(n).

%e For n = 4 we have:

%e ------------------------------------

%e Partitions Number of parts

%e . which are powers of 2

%e ------------------------------------

%e 4 ..................... 1

%e 3 + 1 ................. 1

%e 2 + 2 ................. 2

%e 2 + 1 + 1 ............. 3

%e 1 + 1 + 1 + 1 ......... 4

%e ------------------------------------

%e Total ................ 11

%e So a(4) = 11.

%t nmax = 43; CoefficientList[Series[Sum[x^(2^k)/(1 - x^(2^k)), {k, 0, Floor[Log[2, nmax]] + 1}]/Product[(1 - x^j), {j, 1, nmax}], {x, 0, nmax}], x]

%t Table[Sum[IntegerExponent[2 k, 2] PartitionsP[n - k], {k, 1, n}], {n, 0, 43}]

%Y Cf. A000041, A000070, A000079, A001511, A006128, A073119, A342231.

%K nonn

%O 0,3

%A _Ilya Gutkovskiy_, Mar 06 2021

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 1 00:14 EDT 2024. Contains 375575 sequences. (Running on oeis4.)