a(n) = number of partitions p of n such that the greatest multiplicity of the parts of p is a part of p.
A365613
a(n) = number of partitions p of n such that the greatest multiplicity of the parts of p is a part of p.
Terms
- a(0) =0a(1) =1a(2) =0a(3) =1a(4) =3a(5) =2a(6) =4a(7) =4a(8) =9a(9) =11a(10) =18a(11) =19a(12) =30a(13) =36a(14) =51a(15) =64a(16) =90a(17) =107a(18) =150a(19) =182a(20) =239a(21) =294a(22) =385a(23) =466a(24) =602a(25) =733a(26) =928a(27) =1129a(28) =1420a(29) =1714
External references
- oeis: A365613