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!)
A240854 Number of partitions p of n into distinct parts not including 2*min(p). 3

%I #4 Apr 22 2014 01:29:16

%S 0,1,1,1,2,3,2,4,5,5,8,9,10,13,15,19,23,26,30,38,45,49,60,70,80,95,

%T 110,126,145,167,191,223,254,286,330,376,426,486,551,622,708,797,896,

%U 1015,1141,1283,1444,1620,1811,2031,2274,2538,2839,3166,3527,3933

%N Number of partitions p of n into distinct parts not including 2*min(p).

%F a(n) + A240853(n) = A000009(n) for n >= 0.

%e a(9) counts these 5 partitions: 9, 81, 72, 54, 531.

%t z = 40; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; Table[Count[f[n], p_ /; MemberQ[p, 2*Min[p]]], {n, 0, z}] (* A240853 *)

%t Table[Count[f[n], p_ /; !MemberQ[p, 2*Min[p]]], {n, 0, z}] (* A240854 *)

%Y Cf. A240854, A000009.

%K nonn,easy

%O 0,5

%A _Clark Kimberling_, Apr 14 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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)