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.

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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, 10, 8, 10, 9, 12, 10, 12, 11, 14, 12, 14, 13, 17, 15, 17, 16, 20, 18, 20, 19, 23, 21, 23, 22, 27, 24, 27, 25, 31, 27, 31, 28, 35, 30, 35, 31, 41, 34, 41, 36, 47, 40, 49, 44, 56, 48, 59, 52]