cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A240219 Number of partitions p of n such that median(p) = mean(p).

This page as a plain text file.
%I A240219 #7 Apr 15 2014 14:38:30
%S A240219 1,2,3,4,4,8,5,9,10,14,7,24,8,22,31,28,10,56,11,71,68,47,13,143,69,66,
%T A240219 147,216,16,367,17,241,304,122,509,1019,20,163,603,1238,22,1712,23,
%U A240219 1789,3144,286,25,3956,1581,2481,2101,4638,28,7739,7357,9209,3737
%N A240219 Number of partitions p of n such that median(p) = mean(p).
%F A240219 a(n) = A240218(n) - A240217(n) for n >= 1.
%F A240219 a(n) + A240217(n) + A240220 = A000041(n) for n >= 1.
%e A240219 a(6) counts these 8 partitions:  6, 51, 42, 33, 331, 222, 2211, 111111.
%t A240219 z = 60; f[n_] := f[n] = IntegerPartitions[n];
%t A240219 Table[Count[f[n], p_ /; Median[p] < Mean[p]], {n, 1, z}]  (* A240217 *)
%t A240219 Table[Count[f[n], p_ /; Median[p] <= Mean[p]], {n, 1, z}] (* A240218 *)
%t A240219 Table[Count[f[n], p_ /; Median[p] == Mean[p]], {n, 1, z}] (* A240219 *)
%t A240219 Table[Count[f[n], p_ /; Median[p] > Mean[p]], {n, 1, z}]  (* A240220 *)
%t A240219 Table[Count[f[n], p_ /; Median[p] >= Mean[p]], {n, 1, z}] (* A240221 *)
%Y A240219 Cf. A240217, A240218, A240220, A240221, A000041.
%K A240219 nonn,easy
%O A240219 1,2
%A A240219 _Clark Kimberling_, Apr 04 2014