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.

A228428 Number of ways to write n = x + y (x, y > 0) with p(99, x) + p(100, y) prime, where p(m, k) denotes the m-gonal number (m-2)*k*(k-1)/2 + k.

Table of values

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

List of values

[0, 1, 1, 1, 2, 1, 1, 1, 3, 3, 1, 2, 4, 1, 3, 5, 4, 3, 5, 1, 4, 3, 2, 1, 7, 5, 1, 4, 4, 4, 4, 5, 2, 5, 4, 2, 6, 1, 4, 9, 6, 4, 6, 6, 5, 6, 5, 4, 6, 5, 11, 9, 6, 5, 10, 4, 3, 9, 5, 3, 11, 7, 7, 10, 5, 5, 10, 5, 5, 5, 4, 7, 6, 6, 5, 13, 7, 3, 12, 5, 5, 12, 6, 7, 8, 6, 4, 9, 7, 8, 9, 10, 9, 9, 8, 15, 17, 9, 9, 10]