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.

A272878 a(0) = a(1) = 1, smallest a(n+1) > a(n-1) such that a(n)^2 + a(n+1)^2 is prime.

Table of values

n a(n)
0 1
1 1
2 2
3 3
4 8
5 5
6 16
7 9
8 26
9 11
10 30
11 13
12 32
13 15
14 34
15 21
16 44
17 29
18 46
19 39
20 50
21 43
22 60
23 61
24 64
25 71
26 66
27 79
28 74
29 81
30 100
31 83
32 102
33 95
34 104
35 101
36 114
37 109
38 134
39 115
40 136
41 135
42 146
43 139
44 154
45 141
46 160
47 143
48 168
49 155
50 172
51 165
52 178
53 173
54 190
55 177
56 200
57 189
58 206
59 199

List of values

[1, 1, 2, 3, 8, 5, 16, 9, 26, 11, 30, 13, 32, 15, 34, 21, 44, 29, 46, 39, 50, 43, 60, 61, 64, 71, 66, 79, 74, 81, 100, 83, 102, 95, 104, 101, 114, 109, 134, 115, 136, 135, 146, 139, 154, 141, 160, 143, 168, 155, 172, 165, 178, 173, 190, 177, 200, 189, 206, 199]