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.

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

Table of values

n a(n)
6 0
7 0
8 1
9 1
10 3
11 4
12 8
13 11
14 19
15 26
16 40
17 54
18 79
19 104
20 146
21 190
22 257
23 330
24 436
25 552
26 715
27 896
28 1140
29 1415
30 1777
31 2184
32 2711
33 3308
34 4063
35 4922
36 5995
37 7214
38 8720
39 10435
40 12525
41 14910
42 17793
43 21076
44 25016
45 29507
46 34850
47 40941
48 48148
49 56351
50 66007
51 76995
52 89855
53 104484

List of values

[0, 0, 1, 1, 3, 4, 8, 11, 19, 26, 40, 54, 79, 104, 146, 190, 257, 330, 436, 552, 715, 896, 1140, 1415, 1777, 2184, 2711, 3308, 4063, 4922, 5995, 7214, 8720, 10435, 12525, 14910, 17793, 21076, 25016, 29507, 34850, 40941, 48148, 56351, 66007, 76995, 89855, 104484]