a(n) = number of partitions p of n such that the greatest multiplicity of the parts of p is not a part of p.
A365616
a(n) = number of partitions p of n such that the greatest multiplicity of the parts of p is not a part of p.
Terms
- a(0) =1a(1) =0a(2) =2a(3) =2a(4) =2a(5) =5a(6) =7a(7) =11a(8) =13a(9) =19a(10) =24a(11) =37a(12) =47a(13) =65a(14) =84a(15) =112a(16) =141a(17) =190a(18) =235a(19) =308a(20) =388a(21) =498a(22) =617a(23) =789a(24) =973a(25) =1225a(26) =1508a(27) =1881a(28) =2298a(29) =2851
External references
- oeis: A365616