a(n) = greatest number of unrestricted partitions between successive strict partitions of n, with partitions listed in Mathematica order.
A366883
a(n) = greatest number of unrestricted partitions between successive strict partitions of n, with partitions listed in Mathematica order.
Terms
- a(0) =0a(1) =0a(2) =0a(3) =2a(4) =1a(5) =2a(6) =4a(7) =7a(8) =5a(9) =7a(10) =13a(11) =19a(12) =26a(13) =22a(14) =27a(15) =45a(16) =61a(17) =78a(18) =99a(19) =87a(20) =107a(21) =166a(22) =213a(23) =267a(24) =324a(25) =396a(26) =361a(27) =434a(28) =644a(29) =806
External references
- oeis: A366883