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.

A098052 T(n,k) counts the solid partitions of n that can be extended to a solid partition of n+1 in exactly (k+3) ways. Equivalently, the number of solid partitions of n that have exactly k+3 partitions of n+1 majoring them.

Table of values

n a(n)
4 1
5 4
6 4
7 6
8 10
9 12
10 0
11 4
12 4
13 30
14 12
15 12
16 0
17 0
18 1
19 16
20 48
21 18
22 48
23 0
24 6
25 4
26 4
27 70
28 72
29 100
30 27
31 12
32 22
33 20
34 102
35 114
36 232
37 76
38 66
39 68
40 6
41 10
42 114
43 231
44 448
45 232
46 180
47 201
48 48
49 16
50 204
51 330
52 728
53 628
54 462
55 546
56 184
57 24

List of values

[1, 4, 4, 6, 10, 12, 0, 4, 4, 30, 12, 12, 0, 0, 1, 16, 48, 18, 48, 0, 6, 4, 4, 70, 72, 100, 27, 12, 22, 20, 102, 114, 232, 76, 66, 68, 6, 10, 114, 231, 448, 232, 180, 201, 48, 16, 204, 330, 728, 628, 462, 546, 184, 24]

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

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