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.

A214576 Triangle read by rows: T(n,k) is the number of partitions of n in which each part is divisible by the next and have last part equal to k (1<=k<=n).

Table of values

n a(n)
1 1
2 1
3 1
4 2
5 0
6 1
7 3
8 1
9 0
10 1
11 5
12 0
13 0
14 0
15 1
16 6
17 2
18 1
19 0
20 0
21 1
22 10
23 0
24 0
25 0
26 0
27 0
28 1
29 11
30 3
31 0
32 1
33 0
34 0
35 0
36 1
37 16
38 0
39 2
40 0
41 0
42 0
43 0
44 0
45 1
46 19
47 5
48 0
49 0
50 1
51 0
52 0
53 0
54 0
55 1
56 26
57 0
58 0
59 0
60 0
61 0
62 0
63 0
64 0
65 0
66 1
67 27
68 6
69 3
70 2
71 0
72 1
73 0
74 0
75 0
76 0
77 0
78 1
79 40
80 0
81 0
82 0
83 0
84 0
85 0
86 0
87 0
88 0
89 0
90 0
91 1

List of values

[1, 1, 1, 2, 0, 1, 3, 1, 0, 1, 5, 0, 0, 0, 1, 6, 2, 1, 0, 0, 1, 10, 0, 0, 0, 0, 0, 1, 11, 3, 0, 1, 0, 0, 0, 1, 16, 0, 2, 0, 0, 0, 0, 0, 1, 19, 5, 0, 0, 1, 0, 0, 0, 0, 1, 26, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 27, 6, 3, 2, 0, 1, 0, 0, 0, 0, 0, 1, 40, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1]