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 A307683 #16 Mar 17 2023 11:29:37
%S A307683 0,0,1,0,2,1,4,1,7,5,11,8,18,17,31,28,47,51,75,81,119,134,181,206,277,
%T A307683 323,420,488,623,737,922,1084,1352,1597,1960,2313,2819,3330,4029,4743,
%U A307683 5704,6722,8030,9434,11234,13175,15601,18262,21552,25184,29612,34518
%N A307683 Number of partitions of n having a non-integer median.
%C A307683 This sequence and A325347 partition the partition numbers, A000041.
%C A307683 The median of a multiset is either the middle part (for odd length), or the average of the two middle parts (for even length). - _Gus Wiseman_, Mar 16 2023
%H A307683 Fausto A. C. Cariboni, <a href="/A307683/b307683.txt">Table of n, a(n) for n = 1..180</a>
%e A307683 a(7) counts these 4 partitions: [6,1], [5,2], [4,3], [3,2,1,1].
%t A307683 Table[Count[IntegerPartitions[n], q_ /; !IntegerQ[Median[q]]], {n, 10}]
%Y A307683 The complement is counted by A325347, strict A359907.
%Y A307683 For mean instead of median we have A349156, strict A361391.
%Y A307683 These partitions have ranks A359912, complement A359908.
%Y A307683 The strict case is A360952.
%Y A307683 A000041 counts integer partitions, strict A000009.
%Y A307683 A008284/A058398/A327482 count partitions by mean.
%Y A307683 A359893/A359901/A359902 count partitions by median.
%Y A307683 Cf. A000016, A051293, A067538, A082550, A240219, A240850, A316413, A326567/A326568, A327475, A359897, A360005.
%K A307683 nonn,easy
%O A307683 1,5
%A A307683 _Clark Kimberling_, Apr 24 2019