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.

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

Table of values

n a(n)
9 0
10 0
11 1
12 1
13 3
14 4
15 8
16 11
17 19
18 26
19 41
20 56
21 83
22 111
23 158
24 209
25 287
26 375
27 503
28 648
29 852
30 1086
31 1403
32 1770
33 2255
34 2817
35 3546
36 4393
37 5469
38 6723
39 8294
40 10120
41 12382
42 15011
43 18228
44 21965
45 26497
46 31749
47 38069
48 45383
49 54114
50 64204
51 76176
52 89975
53 106259
54 124998
55 146987

List of values

[0, 0, 1, 1, 3, 4, 8, 11, 19, 26, 41, 56, 83, 111, 158, 209, 287, 375, 503, 648, 852, 1086, 1403, 1770, 2255, 2817, 3546, 4393, 5469, 6723, 8294, 10120, 12382, 15011, 18228, 21965, 26497, 31749, 38069, 45383, 54114, 64204, 76176, 89975, 106259, 124998, 146987]