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.

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

List of values

[0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 1, 2, 1, 2, 1, 3, 2, 4, 3, 5, 4, 6, 5, 7, 6, 9, 7, 9, 8, 11, 9, 11, 10, 13, 11, 14, 13, 16, 14, 17, 16, 19, 17, 20, 19, 23, 20, 24, 22, 27, 23, 28, 25, 31, 26, 34, 29, 37, 31, 40, 35, 45, 39, 49, 43, 56, 48, 61, 54, 69, 59, 74, 67, 83, 73, 91, 82]