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.

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

Table of values

n a(n)
7 0
8 0
9 1
10 1
11 3
12 4
13 8
14 11
15 19
16 26
17 41
18 55
19 81
20 108
21 152
22 199
23 272
24 351
25 467
26 596
27 776
28 979
29 1255
30 1566
31 1978
32 2448
33 3054
34 3747
35 4628
36 5635
37 6896
38 8342
39 10125
40 12172
41 14673
42 17537
43 21005
44 24981
45 29748
46 35210
47 41718
48 49161
49 57974
50 68049
51 79902
52 93440
53 109295

List of values

[0, 0, 1, 1, 3, 4, 8, 11, 19, 26, 41, 55, 81, 108, 152, 199, 272, 351, 467, 596, 776, 979, 1255, 1566, 1978, 2448, 3054, 3747, 4628, 5635, 6896, 8342, 10125, 12172, 14673, 17537, 21005, 24981, 29748, 35210, 41718, 49161, 57974, 68049, 79902, 93440, 109295]