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!)
A239263 Number of partitions of n having (sum of odd parts) >= (sum of even parts). 5

%I #8 Mar 15 2014 16:58:01

%S 1,1,1,2,3,5,6,8,14,19,24,30,49,61,75,93,144,177,217,260,385,461,556,

%T 663,956,1137,1353,1603,2222,2625,3093,3622,4956,5796,6790,7907,10578,

%U 12299,14283,16558,21830,25269,29175,33607,43656,50227,57723,66199,85183

%N Number of partitions of n having (sum of odd parts) >= (sum of even parts).

%H Alois P. Heinz, <a href="/A239263/b239263.txt">Table of n, a(n) for n = 0..500</a>

%F a(n) + A239259(n) = A000041(n).

%e a(8) counts these 14 partitions: 71, 53, 521, 5111, 431, 41111, 332, 3311, 3221, 32111, 311111, 221111, 2111111, 11111111.

%t z = 40; p[n_] := p[n] = IntegerPartitions[n]; f[t_] := f[t] = Length[t]

%t t1 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] < n &]], {n, z}] (* A239259 *)

%t t2 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] <= n &]], {n, z}] (* A239260 *)

%t t3 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] == n &]], {n, z}] (* A239261 *)

%t t4 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] > n &]], {n, z}] (* A239262 *)

%t t5 = Table[f[Select[p[n], 2 Total[Select[#, OddQ]] >= n &]], {n, z}] (* A239263 *)

%t (* _Peter J. C. Moses_, Mar 12 2014 *)

%Y Cf. A239259, A239260, A239261, A239262, A000041.

%K nonn,easy

%O 0,4

%A _Clark Kimberling_, Mar 13 2014

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 18 20:10 EDT 2024. Contains 371781 sequences. (Running on oeis4.)