login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A240875     Number of partitions p of n into distinct parts such that median(p) < mean(p). 0

%I

%S 0,0,0,0,0,0,0,1,1,1,3,4,4,8,8,11,16,20,20,32,32,44,53,66,68,89,105,

%T 127,146,172,179,253,269,306,352,403,481,577,616,694,793,965,1028,

%U 1243,1334,1482,1811,2008,2143,2468,2765,3208,3629,4021,4311,4905,5493

%N Number of partitions p of n into distinct parts such that median(p) < mean(p).

%e a(11) counts these 4 partitions: 821, 731, 632, 3321; e.g., median(p) = 3 < 11/3 = mean(p) for p = {6,3,2}.

%t z = 70; f[n_] := f[n] = Select[IntegerPartitions[n], Max[Length /@ Split@#] == 1 &]; Table[Count[f[n], p_ /; Median[p] < Mean[p]], {n, 0, z}]

%Y Cf. A240217.

%K nonn,easy

%O 0,11

%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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 27 20:35 EDT 2020. Contains 337388 sequences. (Running on oeis4.)