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 A240450 #14 Jul 08 2020 21:58:01
%S A240450 2,1,3,2,3,4,3,4,3,5,4,5,4,5,6,5,6,5,6,5,7,6,7,6,7,6,7,8,7,8,7,8,7,8,
%T A240450 7,9,8,9,8,9
%N A240450 Greatest number of distinct numbers in the intersection of p and its conjugate, as p ranges through the partitions of n.
%C A240450 Number of terms in row n of the array at A240181.
%C A240450 To match the definition, all terms need to be decreased by 1 (because the rows in A240181 start with k=0). So this appears to be an incorrect duplicate of A067731. - _Joerg Arndt_, Jul 30 2017
%t A240450 z = 30; conjugatePartition[part_] := Table[Count[#, _?(# >= i &)], {i, First[#]}] &[part]; c = Map[BinCounts[#, {0, 1 + Max[#]}] &[Map[Length, Map[Intersection[#, conjugatePartition[#]] &, IntegerPartitions[#]]]] &, Range[z]]; Flatten[c] (* A240181 *)
%t A240450 Table[Length[c[[n]]], {n, 1, z}] (* A240450 *) (* _Peter J. C. Moses_, Apr 10 2014 *)
%Y A240450 Cf. A067731, A240181.
%K A240450 nonn,more
%O A240450 1,1
%A A240450 _Clark Kimberling_, Apr 12 2014