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.

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

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 8, 6, 8, 7, 10, 8, 10, 9, 13, 11, 13, 12, 16, 14, 16, 15, 20, 17, 20, 18, 24, 20, 24, 21, 30, 24, 30, 26, 36, 30, 38, 34, 46, 39, 49, 43, 57, 49, 62, 55, 72, 62, 77, 68, 87, 77, 94, 85, 106, 95, 114, 104, 128, 116, 138]