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.

A122934 Triangle T(n,k) = number of partitions of n into k parts, with each part size divisible by the next.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 1, 1, 1, 3, 2, 2, 1, 1, 1, 3, 2, 4, 2, 2, 1, 1, 1, 2, 4, 2, 4, 2, 2, 1, 1, 1, 3, 4, 5, 3, 4, 2, 2, 1, 1, 1, 1, 3, 4, 5, 3, 4, 2, 2, 1, 1, 1, 5, 4, 6, 5, 6, 3, 4, 2, 2, 1, 1, 1, 1, 5, 4, 6, 5, 6, 3, 4, 2, 2, 1, 1, 1, 3, 4, 7, 6, 7, 6, 6, 3, 4, 2, 2, 1, 1]