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.

A101199 Number of partitions of n with rank 2 (the rank of a partition is the largest part minus the number of parts).

Table of values

n a(n)
1 0
2 0
3 1
4 0
5 1
6 1
7 2
8 2
9 3
10 3
11 6
12 6
13 9
14 10
15 15
16 16
17 23
18 27
19 36
20 42
21 55
22 64
23 84
24 98
25 124
26 147
27 185
28 217
29 270
30 318
31 391
32 461
33 562
34 661
35 802
36 942
37 1132
38 1331
39 1592
40 1864
41 2220
42 2597
43 3077
44 3593
45 4240
46 4940
47 5811
48 6758
49 7916
50 9192
51 10737
52 12438
53 14488
54 16755
55 19459
56 22465
57 26024
58 29987

List of values

[0, 0, 1, 0, 1, 1, 2, 2, 3, 3, 6, 6, 9, 10, 15, 16, 23, 27, 36, 42, 55, 64, 84, 98, 124, 147, 185, 217, 270, 318, 391, 461, 562, 661, 802, 942, 1132, 1331, 1592, 1864, 2220, 2597, 3077, 3593, 4240, 4940, 5811, 6758, 7916, 9192, 10737, 12438, 14488, 16755, 19459, 22465, 26024, 29987]