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.

A112669 Triangle read by rows: T(n,k) = number of plane partitions of n that can be extended in k ways to a plane partition of n+1 by adding 1 element to it.

Table of values

n a(n)
1 1
2 3
3 3
4 3
5 6
6 6
7 0
8 1
9 3
10 15
11 3
12 3
13 9
14 21
15 6
16 12
17 3
18 34
19 21
20 25
21 3
22 10
23 45
24 36
25 54
26 15
27 6
28 54
29 72
30 108
31 36
32 6
33 9
34 84
35 102
36 172
37 117
38 15
39 0
40 1
41 3
42 84
43 174
44 306
45 228
46 54
47 7
48 3
49 18
50 114
51 225
52 483
53 447
54 162
55 18
56 12
57 3
58 114
59 348
60 724
61 824
62 369
63 66
64 37
65 9
66 171
67 453

List of values

[1, 3, 3, 3, 6, 6, 0, 1, 3, 15, 3, 3, 9, 21, 6, 12, 3, 34, 21, 25, 3, 10, 45, 36, 54, 15, 6, 54, 72, 108, 36, 6, 9, 84, 102, 172, 117, 15, 0, 1, 3, 84, 174, 306, 228, 54, 7, 3, 18, 114, 225, 483, 447, 162, 18, 12, 3, 114, 348, 724, 824, 369, 66, 37, 9, 171, 453]

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

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