cp's OEIS Frontend

A238788 Number of palindromic partitions of n whose least part has multiplicity <= 2.

%I A238788 #4 Mar 12 2014 12:57:35
%S A238788 1,2,1,3,3,4,4,7,6,11,9,13,15,22,18,29,28,40,38,55,52,75,70,97,96,133,
%T A238788 123,173,167,225,215,291,282,380,361,479,468,619,590,780,757,986,952,
%U A238788 1239,1202,1555,1500,1931,1882,2409,2328,2975,2898,3676,3568,4517
%N A238788 Number of palindromic partitions of n whose least part has multiplicity <= 2.
%C A238788 Palindromic partitions are defined at A025065.
%e A238788 a(8) counts these 7 partitions (written as palindromes):  8, 161, 44, 242, 323, 1331, 12221
%t A238788 z = 40; p[n_, k_] := Select[IntegerPartitions[n], (Count[OddQ[Transpose[Tally[#]][[2]]], True] <= 1) && (Count[#, Min[#]] <= k) &]
%t A238788 Table[p[n, 2], {n, 1, 12}]
%t A238788 t2 = Table[Length[p[n, 2]], {n, 1, z}]  (* A238788 *)
%t A238788 Table[p[n, 3], {n, 1, 12}]
%t A238788 t3 = Table[Length[p[n, 3]], {n, 1, z}]  (* A238789 *)
%t A238788 Table[p[n, 4], {n, 1, 12}]
%t A238788 t4 = Table[Length[p[n, 4]], {n, 1, z}]  (* A238790 *)
%t A238788 (* _Peter J. C. Moses_, Mar 03 2014 *)
%Y A238788 Cf. A025065, A238789, A238790, A238779.
%K A238788 nonn,easy
%O A238788 1,2
%A A238788 _Clark Kimberling_, Mar 05 2014