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 A238793 #4 Mar 12 2014 12:58:14
%S A238793 0,0,0,0,1,0,1,1,1,2,3,1,3,3,6,5,6,5,9,9,13,10,17,13,23,18,29,23,37,
%T A238793 32,48,37,64,48,81,60,99,77,130,94,158,123,200,145,252,182,309,224,
%U A238793 381,277,475,331,575,414,712,497,866,605,1049,736,1274,883,1555
%N A238793 Number of palindromic partitions of n such that 2*(multiplicity of least part) = (multiplicity of greatest part).
%C A238793 Palindromic partitions are defined at A025065.
%e A238793 a(15) counts these 6 partitions (written as palindromes): 717, 636, 25152, 13431, 12233221..
%t A238793 z = 65; p[n_] := p[n] = Select[IntegerPartitions[n], (Count[OddQ[Transpose[Tally[#]][[2]]], True] <= 1) && (2*Count[#, Min[#]] == Count[#, Max[#]]) &]; Table[p[n], {n, 1, 16}]
%t A238793 t1 = Table[Length[p[n]], {n, 1, z}]
%t A238793 (* _Peter J. C. Moses_, Mar 03 2014 *)
%Y A238793 Cf. A025065, A238791, A238792, A238779.
%K A238793 nonn,easy
%O A238793 1,10
%A A238793 _Clark Kimberling_, Mar 05 2014