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.

A161266 Number of partitions of n into central polygonal numbers A000124 where every part appears at least 13 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 0
12 0
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 1
26 2
27 1
28 2
29 1
30 2
31 1
32 2
33 1
34 2
35 1
36 2
37 1
38 2
39 2
40 3
41 3
42 4
43 4
44 5
45 5
46 6
47 6
48 7
49 7
50 8
51 8
52 10
53 9
54 10
55 10
56 12
57 11
58 12
59 12
60 14
61 13
62 14
63 14
64 16
65 16
66 17
67 17
68 19
69 19
70 20
71 20
72 22
73 22
74 23
75 23
76 25
77 25
78 27
79 26
80 29
81 28
82 31
83 29
84 33
85 31
86 35
87 32
88 37
89 34
90 39
91 37
92 42
93 39
94 45
95 42
96 49

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 10, 9, 10, 10, 12, 11, 12, 12, 14, 13, 14, 14, 16, 16, 17, 17, 19, 19, 20, 20, 22, 22, 23, 23, 25, 25, 27, 26, 29, 28, 31, 29, 33, 31, 35, 32, 37, 34, 39, 37, 42, 39, 45, 42, 49]