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.

A214575 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 first part equal to k (1 <= k <= n).

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

List of values

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