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.

A325458 Triangle read by rows where T(n,k) is the number of integer partitions of n with largest hook of size k, i.e., with (largest part) + (number of parts) - 1 = k.

Table of values

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

List of values

[1, 0, 1, 0, 0, 2, 0, 0, 0, 3, 0, 0, 0, 1, 4, 0, 0, 0, 0, 2, 5, 0, 0, 0, 0, 2, 3, 6, 0, 0, 0, 0, 0, 4, 4, 7, 0, 0, 0, 0, 0, 3, 6, 5, 8, 0, 0, 0, 0, 0, 1, 6, 8, 6, 9, 0, 0, 0, 0, 0, 0, 6, 9, 10, 7, 10, 0, 0, 0, 0, 0, 0, 2, 11, 12, 12, 8, 11]