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.
%I A325347 #17 Feb 22 2023 21:41:58
%S A325347 1,2,2,5,5,10,11,21,23,37,45,69,83,118,145,203,250,334,415,546,673,
%T A325347 868,1074,1369,1681,2113,2590,3230,3942,4867,5920,7265,8791,10713,
%U A325347 12923,15664,18818,22685,27156,32595,38879,46452,55231,65741,77900,92383,109153
%N A325347 Number of partitions of n having an integer median.
%C A325347 This sequence and A307683 partition the partition numbers, A000041.
%H A325347 Fausto A. C. Cariboni, <a href="/A325347/b325347.txt">Table of n, a(n) for n = 1..180</a>
%e A325347 a(5) counts these 5 partitions: [5], [3,1,1], [2,2,1], [2,1,1,1], [1,1,1,1,1].
%t A325347 Table[Count[IntegerPartitions[n], q_ /; IntegerQ[Median[q]]], {n, 10}]
%Y A325347 Cf. A000041, A307683.
%K A325347 nonn
%O A325347 1,2
%A A325347 _Clark Kimberling_, Apr 23 2019