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 A238791 #7 Nov 07 2024 21:59:56
%S A238791 1,2,2,3,2,5,2,5,3,7,2,11,3,10,6,15,5,22,7,28,12,33,15,52,21,59,33,84,
%T A238791 38,112,56,145,77,178,103,251,132,300,184,404,229,507,304,645,398,800,
%U A238791 506,1040,639,1270,832,1608,1032,1988,1310,2479,1640,3031,2053
%N A238791 Number of palindromic partitions of n such that the multiplicities of the least and greatest parts are equal.
%C A238791 Palindromic partitions are defined at A025065.
%e A238791 a(10) counts these 7 partitions (written as palindromes): [10], [5,5], [1,4,4,1], [2,3,3,2], [1,3,2,3,1], [2,2,2,2,2], [1,1,1,1,1,1,1,1,1,1].
%t A238791 z = 40; p[n_] := p[n] = Select[IntegerPartitions[n], (Count[OddQ[Transpose[Tally[#]][[2]]], True] <= 1) && (Count[#, Min[#]] == Count[#, Max[#]]) &]; Table[p[n], {n, 1, 12}]
%t A238791 Table[Length[p[n]], {n, 1, z}]
%Y A238791 Cf. A025065, A238792, A238793, A238779.
%K A238791 nonn,easy
%O A238791 1,2
%A A238791 _Clark Kimberling_, Mar 05 2014