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.

A129654 Number of different ways to represent n as general polygonal number P(m,r) = 1/2*r*((m-2)*r-(m-4)) = n>1, for m,r>1.

Table of values

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

List of values

[1, 2, 2, 2, 3, 2, 2, 3, 3, 2, 3, 2, 2, 4, 3, 2, 3, 2, 2, 4, 3, 2, 3, 3, 2, 3, 4, 2, 3, 2, 2, 3, 3, 3, 5, 2, 2, 3, 3, 2, 3, 2, 2, 5, 3, 2, 3, 3, 2, 4, 3, 2, 3, 4, 2, 3, 3, 2, 3, 2, 2, 3, 4, 3, 5, 2, 2, 3, 4, 2, 3, 2, 2, 4, 3, 2, 4, 2, 2, 5, 3, 2, 3, 3, 2, 3, 3, 2, 3, 4, 3, 3, 3, 3, 4, 2, 2, 3, 4, 2, 3, 2, 2, 5, 3]