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.

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

Table of values

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 8, 7, 8, 8, 10, 9, 10, 10, 12, 12, 13, 13, 15, 15, 16, 16, 18, 18, 20, 19, 22, 21, 24, 22, 26, 24, 28, 27, 31, 29, 34, 32, 38, 36, 43, 40, 48, 46, 53, 51, 59, 58, 65, 64, 73, 72, 80, 79, 89, 87, 97, 96, 107, 105]