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.

A161264 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 11 times.

Table of values

n a(n)
1 0
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
10 0
11 1
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 2
23 1
24 2
25 1
26 2
27 1
28 2
29 1
30 2
31 1
32 2
33 2
34 3
35 3
36 4
37 4
38 5
39 5
40 6
41 6
42 7
43 7
44 9
45 8
46 9
47 9
48 11
49 10
50 11
51 11
52 13
53 12
54 13
55 14
56 16
57 15
58 16
59 17
60 19
61 18
62 19
63 20
64 22
65 21
66 23
67 23
68 26
69 24
70 27
71 26
72 30
73 27
74 31
75 29
76 34
77 32
78 36
79 34
80 40
81 37
82 43
83 41
84 49
85 45
86 52
87 50
88 59
89 56
90 64
91 63
92 71
93 68

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 9, 8, 9, 9, 11, 10, 11, 11, 13, 12, 13, 14, 16, 15, 16, 17, 19, 18, 19, 20, 22, 21, 23, 23, 26, 24, 27, 26, 30, 27, 31, 29, 34, 32, 36, 34, 40, 37, 43, 41, 49, 45, 52, 50, 59, 56, 64, 63, 71, 68]