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.

A246452 Let A be the set of all numbers m for which m^2+1 is prime (see A005574). The sequence lists the pairs of numbers (a, b) such that every m > 1 included in A can be written in the form m = a + b for a <= b both in A and a minimum.

Table of values

n a(n)
1 1
2 1
3 2
4 2
5 2
6 4
7 4
8 6
9 4
10 10
11 2
12 14
13 4
14 16
15 4
16 20
17 2
18 24
19 10
20 26
21 4
22 36
23 14
24 40
25 2
26 54
27 10
28 56
29 20
30 54
31 10
32 74
33 6
34 84
35 4
36 90
37 16
38 94
39 6
40 110
41 4
42 116
43 4
44 120
45 2
46 124
47 4
48 126
49 4
50 130
51 16
52 130
53 4
54 146
55 6
56 150
57 4
58 156
59 10
60 160
61 6
62 170
63 4
64 176
65 4
66 180
67 20
68 184

List of values

[1, 1, 2, 2, 2, 4, 4, 6, 4, 10, 2, 14, 4, 16, 4, 20, 2, 24, 10, 26, 4, 36, 14, 40, 2, 54, 10, 56, 20, 54, 10, 74, 6, 84, 4, 90, 16, 94, 6, 110, 4, 116, 4, 120, 2, 124, 4, 126, 4, 130, 16, 130, 4, 146, 6, 150, 4, 156, 10, 160, 6, 170, 4, 176, 4, 180, 20, 184]