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.

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

List of values

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