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.

A094504 T(n,m) equals number of solid partitions of n containing m plane partitions.

Table of values

n a(n)
1 1
2 3
3 1
4 6
5 3
6 1
7 13
8 9
9 3
10 1
11 24
12 22
13 9
14 3
15 1
16 48
17 54
18 25
19 9
20 3
21 1
22 86
23 120
24 63
25 25
26 9
27 3
28 1
29 160
30 267
31 153
32 66
33 25
34 9
35 3
36 1
37 282
38 559
39 357
40 162
41 66
42 25
43 9
44 3
45 1
46 500
47 1158
48 805
49 390
50 165
51 66
52 25
53 9
54 3
55 1
56 859
57 2314
58 1761
59 898
60 399
61 165
62 66
63 25
64 9
65 3
66 1
67 1479
68 4559
69 3761
70 2025
71 931
72 402
73 165
74 66
75 25
76 9
77 3
78 1

List of values

[1, 3, 1, 6, 3, 1, 13, 9, 3, 1, 24, 22, 9, 3, 1, 48, 54, 25, 9, 3, 1, 86, 120, 63, 25, 9, 3, 1, 160, 267, 153, 66, 25, 9, 3, 1, 282, 559, 357, 162, 66, 25, 9, 3, 1, 500, 1158, 805, 390, 165, 66, 25, 9, 3, 1, 859, 2314, 1761, 898, 399, 165, 66, 25, 9, 3, 1, 1479, 4559, 3761, 2025, 931, 402, 165, 66, 25, 9, 3, 1]