cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

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.

Table of values

n a(n)
0 1
1 1
2 1
3 3
4 6
5 15
6 60
7 210
8 840
9 3780
10 12600
11 69300
12 415800
13 2702700
14 12612600
15 94594500
16 756756000
17 4288284000
18 38594556000
19 244432188000
20 1833241410000
21 17110253160000
22 141159588570000
23 1298668214844000
24 10389345718752000
25 108222351237000000
26 1125512452864800000

List of values

[1, 1, 1, 3, 6, 15, 60, 210, 840, 3780, 12600, 69300, 415800, 2702700, 12612600, 94594500, 756756000, 4288284000, 38594556000, 244432188000, 1833241410000, 17110253160000, 141159588570000, 1298668214844000, 10389345718752000, 108222351237000000, 1125512452864800000]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.