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 A238792 #4 Mar 12 2014 12:58:06
%S A238792 0,0,0,1,1,1,2,3,3,5,4,8,7,12,11,17,14,24,22,34,31,47,39,66,56,85,76,
%T A238792 115,98,158,130,198,176,260,226,342,289,432,382,558,476,716,611,895,
%U A238792 784,1129,975,1430,1229,1775,1551,2211,1914,2756,2385,3394,2964
%N A238792 Number of palindromic partitions of n such that (multiplicity of least part) = 2*(multiplicity of greatest part).
%C A238792 Palindromic partitions are defined at A025065.
%e A238792 a(10) counts these 5 partitions (written as palindromes): 181, 262, 343, 12421, 113311.
%t A238792 z = 40; p[n_] := p[n] = Select[IntegerPartitions[n], (Count[OddQ[Transpose[Tally[#]][[2]]], True] <= 1) && (Count[#, Min[#]] == 2*Count[#, Max[#]]) &]; Table[p[n], {n, 1, 12}]
%t A238792 Table[Length[p[n]], {n, 1, z}]
%Y A238792 Cf. A025065, A238791, A238793, A238779.
%K A238792 nonn,easy
%O A238792 1,7
%A A238792 _Clark Kimberling_, Mar 05 2014