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!)
A238483 Number of partitions p of n not containing floor((min(p) + max(p))/2) as a part. 2

%I #10 Mar 01 2014 05:14:23

%S 0,0,0,1,2,4,6,11,14,22,31,42,56,81,100,136,180,231,294,388,483,618,

%T 784,980,1221,1543,1894,2354,2912,3572,4372,5375,6525,7947,9648,11668,

%U 14074,17001,20389,24475,29319,35017,41744,49759,59065,70103,83044,98189

%N Number of partitions p of n not containing floor((min(p) + max(p))/2) as a part.

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

%e a(6) counts these partitions: 51, 42, 411, 3111.

%t Table[Count[IntegerPartitions[n], p_ /; !MemberQ[p, Floor[(Min[p] + Max[p])/2]]], {n, 30}]

%Y Cf. A238482.

%K nonn,easy

%O 1,5

%A _Clark Kimberling_, Feb 27 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 25 16:45 EDT 2024. Contains 371989 sequences. (Running on oeis4.)