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.

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

Table of values

n a(n)
4 0
5 0
6 1
7 1
8 3
9 4
10 8
11 11
12 18
13 24
14 37
15 48
16 69
17 89
18 122
19 155
20 207
21 259
22 337
23 419
24 534
25 657
26 827
27 1008
28 1252
29 1518
30 1864
31 2246
32 2736
33 3276
34 3960
35 4722
36 5668
37 6727
38 8032
39 9492
40 11274
41 13279
42 15696
43 18424
44 21694
45 25380
46 29772
47 34736
48 40604
49 47244
50 55060
51 63897

List of values

[0, 0, 1, 1, 3, 4, 8, 11, 18, 24, 37, 48, 69, 89, 122, 155, 207, 259, 337, 419, 534, 657, 827, 1008, 1252, 1518, 1864, 2246, 2736, 3276, 3960, 4722, 5668, 6727, 8032, 9492, 11274, 13279, 15696, 18424, 21694, 25380, 29772, 34736, 40604, 47244, 55060, 63897]