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.

A212543 Number of partitions of n containing at least one part m-3 if m is the largest part.

Table of values

n a(n)
3 0
4 0
5 1
6 1
7 3
8 4
9 8
10 10
11 17
12 22
13 33
14 42
15 60
16 75
17 103
18 128
19 169
20 209
21 271
22 331
23 421
24 513
25 642
26 777
27 963
28 1158
29 1421
30 1703
31 2070
32 2471
33 2985
34 3546
35 4257
36 5043
37 6019
38 7105
39 8443
40 9933
41 11752
42 13790
43 16247
44 19012
45 22326
46 26052
47 30492
48 35500
49 41420
50 48108
51 55980

List of values

[0, 0, 1, 1, 3, 4, 8, 10, 17, 22, 33, 42, 60, 75, 103, 128, 169, 209, 271, 331, 421, 513, 642, 777, 963, 1158, 1421, 1703, 2070, 2471, 2985, 3546, 4257, 5043, 6019, 7105, 8443, 9933, 11752, 13790, 16247, 19012, 22326, 26052, 30492, 35500, 41420, 48108, 55980]