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.

A304869 Triangle read by rows: T(n, k) gives the number of partitions (d1,d2,...,dk) of n such that 0 < d1/1 <= d2/2 <= ... <= dk/k for 1 <= k <= A003056(n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 3, 2, 1, 3, 2, 1, 1, 3, 3, 1, 1, 4, 4, 1, 1, 4, 4, 2, 1, 4, 5, 2, 1, 5, 6, 3, 1, 1, 5, 7, 4, 1, 1, 5, 8, 5, 1, 1, 6, 9, 6, 2, 1, 6, 10, 7, 2, 1, 6, 11, 9, 3, 1, 7, 13, 10, 4, 1, 1, 7, 14, 12, 5, 1, 1, 7, 15, 14, 6, 1]