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.

A325200 Regular triangle read by rows where T(n,k) is the number of integer partitions of n such that the difference between the length of the minimal triangular partition containing and the maximal triangular partition contained in the Young diagram is k.

Table of values

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

List of values

[1, 1, 0, 0, 2, 0, 1, 0, 2, 0, 0, 3, 0, 2, 0, 0, 3, 2, 0, 2, 0, 1, 0, 6, 2, 0, 2, 0, 0, 4, 3, 4, 2, 0, 2, 0, 0, 6, 2, 6, 4, 2, 0, 2, 0, 0, 4, 9, 5, 4, 4, 2, 0, 2, 0, 1, 0, 15, 6, 8, 4, 4, 2, 0, 2, 0, 0, 5, 12, 12, 9, 6, 4, 4, 2, 0, 2, 0, 0, 10, 6, 21, 10, 12, 6, 4, 4, 2, 0, 2, 0]