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.

A363230 Number of partitions of n with rank 3 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 1
5 1
6 2
7 3
8 5
9 7
10 11
11 14
12 21
13 28
14 39
15 51
16 70
17 90
18 120
19 154
20 201
21 256
22 330
23 415
24 529
25 662
26 833
27 1035
28 1293
29 1595
30 1976
31 2425
32 2982
33 3640
34 4449
35 5401
36 6565
37 7935
38 9592
39 11543
40 13891
41 16645
42 19943
43 23808
44 28408
45 33792
46 40172
47 47619
48 56413
49 66661
50 78708
51 92724
52 109149
53 128213
54 150486
55 176293

List of values

[0, 0, 0, 1, 1, 2, 3, 5, 7, 11, 14, 21, 28, 39, 51, 70, 90, 120, 154, 201, 256, 330, 415, 529, 662, 833, 1035, 1293, 1595, 1976, 2425, 2982, 3640, 4449, 5401, 6565, 7935, 9592, 11543, 13891, 16645, 19943, 23808, 28408, 33792, 40172, 47619, 56413, 66661, 78708, 92724, 109149, 128213, 150486, 176293]