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.

A363231 Number of partitions of n with rank 4 or higher (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 0
4 0
5 1
6 1
7 2
8 3
9 5
10 7
11 11
12 15
13 21
14 29
15 40
16 53
17 72
18 94
19 124
20 161
21 209
22 267
23 343
24 435
25 551
26 693
27 870
28 1084
29 1351
30 1672
31 2066
32 2542
33 3121
34 3815
35 4658
36 5664
37 6875
38 8319
39 10049
40 12102
41 14553
42 17452
43 20894
44 24959
45 29766
46 35420
47 42089
48 49911
49 59100
50 69856
51 82452
52 97152
53 114324
54 134315

List of values

[0, 0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 15, 21, 29, 40, 53, 72, 94, 124, 161, 209, 267, 343, 435, 551, 693, 870, 1084, 1351, 1672, 2066, 2542, 3121, 3815, 4658, 5664, 6875, 8319, 10049, 12102, 14553, 17452, 20894, 24959, 29766, 35420, 42089, 49911, 59100, 69856, 82452, 97152, 114324, 134315]