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.

A137169 a(0) = 2; for n>0, a(n) = smallest number m > a(n-1) such that both m-n and m+n are primes.

Table of values

n a(n)
0 2
1 4
2 5
3 8
4 9
5 12
6 13
7 24
8 39
9 50
10 51
11 72
12 85
13 96
14 117
15 122
16 123
17 156
18 175
19 192
20 213
21 218
22 219
23 234
24 247
25 252
26 255
27 256
28 279
29 360
30 367
31 378
32 399
33 400
34 423
35 432
36 455
37 486
38 525
39 530
40 531
41 612
42 619
43 630
44 657
45 664
46 687
47 774
48 775
49 810
50 837
51 860
52 915
53 930
54 937
55 942

List of values

[2, 4, 5, 8, 9, 12, 13, 24, 39, 50, 51, 72, 85, 96, 117, 122, 123, 156, 175, 192, 213, 218, 219, 234, 247, 252, 255, 256, 279, 360, 367, 378, 399, 400, 423, 432, 455, 486, 525, 530, 531, 612, 619, 630, 657, 664, 687, 774, 775, 810, 837, 860, 915, 930, 937, 942]