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.

A098546 Table read by rows: row n has a term T(n,k) for each of the partition(n) partitions of n. T(n,k) = binomial(n,m) where m is the number of parts.

Table of values

n a(n)
1 1
2 2
3 1
4 3
5 3
6 1
7 4
8 6
9 6
10 4
11 1
12 5
13 10
14 10
15 10
16 10
17 5
18 1
19 6
20 15
21 15
22 15
23 20
24 20
25 20
26 15
27 15
28 6
29 1
30 7
31 21
32 21
33 21
34 35
35 35
36 35
37 35
38 35
39 35
40 35
41 21
42 21
43 7
44 1
45 8
46 28
47 28
48 28
49 28
50 56
51 56
52 56
53 56
54 56
55 70
56 70
57 70
58 70
59 70
60 56
61 56
62 56
63 28
64 28
65 8
66 1
67 9
68 36
69 36
70 36
71 36
72 84
73 84
74 84
75 84
76 84
77 84
78 84

List of values

[1, 2, 1, 3, 3, 1, 4, 6, 6, 4, 1, 5, 10, 10, 10, 10, 5, 1, 6, 15, 15, 15, 20, 20, 20, 15, 15, 6, 1, 7, 21, 21, 21, 35, 35, 35, 35, 35, 35, 35, 21, 21, 7, 1, 8, 28, 28, 28, 28, 56, 56, 56, 56, 56, 70, 70, 70, 70, 70, 56, 56, 56, 28, 28, 8, 1, 9, 36, 36, 36, 36, 84, 84, 84, 84, 84, 84, 84]

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

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