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.

A330785 Triangle read by rows where T(n,k) is the number of chains of length k from minimum to maximum in the poset of integer partitions of n ordered by refinement.

Table of values

n a(n)
1 1
2 0
3 1
4 0
5 1
6 1
7 0
8 1
9 3
10 2
11 0
12 1
13 5
14 8
15 4
16 0
17 1
18 9
19 25
20 28
21 11
22 0
23 1
24 13
25 57
26 111
27 99
28 33
29 0
30 1
31 20
32 129
33 379
34 561
35 408
36 116
37 0
38 1
39 28
40 253
41 1057
42 2332
43 2805
44 1739
45 435
46 0
47 1
48 40
49 496
50 2833
51 8695
52 15271
53 15373
54 8253
55 1832
56 0
57 1
58 54
59 898
60 6824
61 28071
62 67790
63 98946
64 85870
65 40789
66 8167

List of values

[1, 0, 1, 0, 1, 1, 0, 1, 3, 2, 0, 1, 5, 8, 4, 0, 1, 9, 25, 28, 11, 0, 1, 13, 57, 111, 99, 33, 0, 1, 20, 129, 379, 561, 408, 116, 0, 1, 28, 253, 1057, 2332, 2805, 1739, 435, 0, 1, 40, 496, 2833, 8695, 15271, 15373, 8253, 1832, 0, 1, 54, 898, 6824, 28071, 67790, 98946, 85870, 40789, 8167]