a(n) = number of partitions p of n such that the least multiplicity of the parts of p is not a part of p.
A365615
a(n) = number of partitions p of n such that the least 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) =3a(6) =5a(7) =5a(8) =9a(9) =10a(10) =15a(11) =20a(12) =25a(13) =30a(14) =41a(15) =50a(16) =61a(17) =81a(18) =99a(19) =123a(20) =154a(21) =189a(22) =231a(23) =292a(24) =346a(25) =429a(26) =526a(27) =639a(28) =759a(29) =942
External references
- oeis: A365615