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.

A056241 Triangle T(n,k) = number of k-part order-consecutive partitions of n (1<=k<=n).

Table of values

n a(n)
1 1
2 1
3 1
4 1
5 3
6 1
7 1
8 6
9 6
10 1
11 1
12 10
13 19
14 10
15 1
16 1
17 15
18 45
19 45
20 15
21 1
22 1
23 21
24 90
25 141
26 90
27 21
28 1
29 1
30 28
31 161
32 357
33 357
34 161
35 28
36 1
37 1
38 36
39 266
40 784
41 1107
42 784
43 266
44 36
45 1
46 1
47 45
48 414
49 1554
50 2907
51 2907
52 1554
53 414
54 45
55 1
56 1
57 55
58 615
59 2850
60 6765
61 8953
62 6765
63 2850
64 615
65 55

List of values

[1, 1, 1, 1, 3, 1, 1, 6, 6, 1, 1, 10, 19, 10, 1, 1, 15, 45, 45, 15, 1, 1, 21, 90, 141, 90, 21, 1, 1, 28, 161, 357, 357, 161, 28, 1, 1, 36, 266, 784, 1107, 784, 266, 36, 1, 1, 45, 414, 1554, 2907, 2907, 1554, 414, 45, 1, 1, 55, 615, 2850, 6765, 8953, 6765, 2850, 615, 55]