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.

A337121 a(n) is the number of ways the n-th prime number prime(n) can be represented as sum of two smaller odd prime numbers p1, p2 with prime(n) > p1 > (p2 minus the maximum odd prime factor of (p1-p2)).

Table of values

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

List of values

[1, 1, 2, 3, 2, 2, 4, 3, 3, 5, 3, 6, 4, 4, 4, 7, 4, 4, 5, 6, 6, 6, 9, 7, 8, 8, 7, 7, 6, 11, 4, 11, 9, 7, 8, 9, 7, 13, 12, 6, 10, 15, 10, 9, 7, 13, 13, 11, 13, 10, 15, 10, 13, 14, 11, 13, 13, 12, 14, 17, 13, 13, 19, 9, 14, 19, 12, 8, 14, 22, 17, 14, 13, 16, 9, 15]