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.

A325194 Regular triangle read by rows where T(n,k) is the number of integer partitions of n with co-rank n - k, where co-rank is the greater of the length and the largest part.

Table of values

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

List of values

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