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.

A195822 Triangle read by rows in which row n lists the Dyson's ranks of all partitions of n that do not contain 1 as a part, in nonincreasing order.

Table of values

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

List of values

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