login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A238784 Number of palindromic partitions of n whose least part has multiplicity 4. 4

%I #4 Mar 12 2014 12:56:57

%S 0,0,0,1,0,1,1,3,1,3,3,7,4,9,6,15,10,19,15,30,21,39,30,56,41,75,58,

%T 103,77,132,106,181,139,231,185,307,241,392,314,508,406,643,523,826,

%U 665,1037,849,1313,1070,1638,1350,2057,1689,2547,2112,3172,2622,3902

%N Number of palindromic partitions of n whose least part has multiplicity 4.

%C Palindromic partitions are defined at A025065.

%e a(12) counts these 7 partitions (written as palindromes): 11811, 114411, 22422, 1124211, 3333, 1132311, 11222211.

%t z = 40; p[n_, k_] := Select[IntegerPartitions[n], (Count[OddQ[Transpose[Tally[#]][[2]]], True] <= 1) && (Count[#, Min[#]] == k) &]

%t Table[p[n, 1], {n, 1, 12}]

%t t1 = Table[Length[p[n, 1]], {n, 1, z}] (* A238781 *)

%t Table[p[n, 2], {n, 1, 12}]

%t t2 = Table[Length[p[n, 2]], {n, 1, z}] (* A238782 *)

%t Table[p[n, 3], {n, 1, 12}]

%t t3 = Table[Length[p[n, 3]], {n, 1, z}] (* A238783 *)

%t Table[p[n, 4], {n, 1, 12}]

%t t4 = Table[Length[p[n, 4]], {n, 1, z}] (* A238784 *)

%t (* _Peter J. C. Moses_, Mar 03 2014 *)

%Y Cf. A025065, A238781, A238782, A238783, A238779.

%K nonn,easy

%O 1,8

%A _Clark Kimberling_, Mar 05 2014

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 25 08:27 EDT 2024. Contains 371964 sequences. (Running on oeis4.)