Let pi be an unrestricted partition of n with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones.
A102437
Let pi be an unrestricted partition of n with the summands written in binary notation. a(n) is the number of such partitions whose binary representation has an odd number of binary ones.
Terms
- a(0) =0a(1) =1a(2) =1a(3) =1a(4) =3a(5) =3a(6) =5a(7) =9a(8) =10a(9) =14a(10) =22a(11) =28a(12) =37a(13) =53a(14) =66a(15) =85a(16) =120a(17) =147a(18) =188a(19) =252a(20) =308a(21) =394a(22) =509a(23) =621a(24) =783a(25) =990a(26) =1210a(27) =1500a(28) =1872a(29) =2272
External references
- oeis: A102437