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.

A330374 Triangle read by rows: T(n,k) is the number of partitions of n whose absolute value of Dyson's rank is equal to k, with 0 <= k < n.

Table of values

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

List of values

[1, 0, 2, 1, 0, 2, 1, 2, 0, 2, 1, 2, 2, 0, 2, 1, 4, 2, 2, 0, 2, 3, 2, 4, 2, 2, 0, 2, 2, 6, 4, 4, 2, 2, 0, 2, 4, 6, 6, 4, 4, 2, 2, 0, 2, 4, 10, 6, 8, 4, 4, 2, 2, 0, 2, 6, 10, 12, 6, 8, 4, 4, 2, 2, 0, 2, 7, 16, 12, 12, 8, 8, 4, 4, 2, 2, 0, 2, 11, 16, 18, 14, 12, 8, 8, 4, 4, 2, 2, 0, 2, 11, 26, 20, 20, 14, 14]