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.

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

Table of values

n a(n)
10 0
11 0
12 1
13 1
14 3
15 4
16 8
17 11
18 19
19 26
20 41
21 56
22 83
23 112
24 159
25 211
26 291
27 381
28 512
29 663
30 873
31 1117
32 1448
33 1833
34 2342
35 2938
36 3708
37 4611
38 5760
39 7105
40 8792
41 10769
42 13215
43 16077
44 19585
45 23679
46 28651
47 34447
48 41424
49 49541
50 59248
51 70509
52 83892
53 99390
54 117695
55 138846
56 163708

List of values

[0, 0, 1, 1, 3, 4, 8, 11, 19, 26, 41, 56, 83, 112, 159, 211, 291, 381, 512, 663, 873, 1117, 1448, 1833, 2342, 2938, 3708, 4611, 5760, 7105, 8792, 10769, 13215, 16077, 19585, 23679, 28651, 34447, 41424, 49541, 59248, 70509, 83892, 99390, 117695, 138846, 163708]