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.

A056940 Number of antichains (or order ideals) in the poset 4*m*n or plane partitions with at most m rows and n columns and entries <= 4.

Table of values

n a(n)
0 1
1 1
2 1
3 1
4 5
5 1
6 1
7 15
8 15
9 1
10 1
11 35
12 105
13 35
14 1
15 1
16 70
17 490
18 490
19 70
20 1
21 1
22 126
23 1764
24 4116
25 1764
26 126
27 1
28 1
29 210
30 5292
31 24696
32 24696
33 5292
34 210
35 1
36 1
37 330
38 13860
39 116424
40 232848
41 116424
42 13860
43 330
44 1
45 1
46 495
47 32670
48 457380
49 1646568
50 1646568
51 457380
52 32670
53 495
54 1

List of values

[1, 1, 1, 1, 5, 1, 1, 15, 15, 1, 1, 35, 105, 35, 1, 1, 70, 490, 490, 70, 1, 1, 126, 1764, 4116, 1764, 126, 1, 1, 210, 5292, 24696, 24696, 5292, 210, 1, 1, 330, 13860, 116424, 232848, 116424, 13860, 330, 1, 1, 495, 32670, 457380, 1646568, 1646568, 457380, 32670, 495, 1]