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.

A362221 Irregular triangle read by rows: T(n, k) is the number of partitions of n into exactly k distinct parts between the members of [k^2].

Table of values

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

List of values

[1, 0, 0, 1, 0, 1, 0, 2, 0, 1, 1, 0, 1, 1, 0, 0, 2, 0, 0, 3, 0, 0, 4, 1, 0, 0, 5, 1, 0, 0, 7, 2, 0, 0, 7, 3, 0, 0, 8, 5, 0, 0, 8, 6, 1, 0, 0, 8, 9, 1, 0, 0, 7, 11, 2, 0, 0, 7, 15, 3, 0, 0, 5, 18, 5, 0, 0, 4, 23, 7, 0, 0, 3, 27, 10, 1, 0, 0, 2, 34, 13, 1, 0, 0, 1, 38, 18, 2]