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.

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

List of values

[0, 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, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 8, 7, 9, 8, 11, 9, 11, 10, 13, 11, 13, 12, 15, 13, 15, 14, 17, 15, 18, 17, 20, 18, 21, 20, 23, 21, 24, 23, 26, 24, 27, 26, 30, 27, 31, 29, 34, 30, 35, 32, 38, 33, 39, 35, 42, 36, 45]