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.

A091298 Triangle read by rows: T(n,k) is the number of plane partitions of n containing exactly k parts.

Table of values

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

List of values

[1, 1, 2, 1, 2, 3, 1, 4, 3, 5, 1, 4, 7, 5, 7, 1, 6, 10, 13, 7, 11, 1, 6, 14, 20, 19, 11, 15, 1, 8, 18, 33, 32, 31, 15, 22, 1, 8, 25, 43, 56, 54, 43, 22, 30, 1, 10, 29, 66, 81, 99, 78, 64, 30, 42, 1, 10, 37, 83, 126, 150, 148, 118, 88, 42, 56, 1, 12, 44, 114, 174, 246, 235, 230, 166, 124, 56, 77]