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.

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

Table of values

n a(n)
8 0
9 0
10 1
11 1
12 3
13 4
14 8
15 11
16 19
17 26
18 41
19 56
20 82
21 110
22 156
23 205
24 281
25 366
26 488
27 627
28 821
29 1041
30 1340
31 1684
32 2135
33 2657
34 3331
35 4108
36 5095
37 6238
38 7663
39 9315
40 11354
41 13709
42 16588
43 19915
44 23936
45 28580
46 34154
47 40573
48 48225
49 57031
50 67452
51 79428
52 93530
53 109695
54 128639

List of values

[0, 0, 1, 1, 3, 4, 8, 11, 19, 26, 41, 56, 82, 110, 156, 205, 281, 366, 488, 627, 821, 1041, 1340, 1684, 2135, 2657, 3331, 4108, 5095, 6238, 7663, 9315, 11354, 13709, 16588, 19915, 23936, 28580, 34154, 40573, 48225, 57031, 67452, 79428, 93530, 109695, 128639]