Problem 66 in Knuth's Art of Computer Programming, vol. 4, section 7.2.1.5 asks which integer partition of n produces the most set partitions. The n-th term of this sequence is the number of set partitions produced by that integer partition.
A102356
Problem 66 in Knuth's Art of Computer Programming, vol. 4, section 7.2.1.5 asks which integer partition of n produces the most set partitions. The n-th term of this sequence is the number of set partitions produced by that integer partition.
Terms
- a(0) =1a(1) =1a(2) =1a(3) =3a(4) =6a(5) =15a(6) =60a(7) =210a(8) =840a(9) =3780a(10) =12600a(11) =69300a(12) =415800a(13) =2702700a(14) =12612600a(15) =94594500a(16) =756756000a(17) =4288284000a(18) =38594556000a(19) =244432188000
External references
- oeis: A102356