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.

A194549 Triangle read by rows: T(n,k) = Dyson's rank of the k-th partition of n that does not contain 1 as a part, with partitions in lexicographic order.

Table of values

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

List of values

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