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.

A087711 a(n) = smallest number k such that both k-n and k+n are primes.

Table of values

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

List of values

[2, 4, 5, 8, 7, 8, 11, 10, 11, 14, 13, 18, 17, 16, 17, 22, 21, 20, 23, 22, 23, 26, 25, 30, 29, 28, 33, 32, 31, 32, 37, 36, 35, 38, 37, 38, 43, 42, 41, 44, 43, 48, 47, 46, 57, 52, 51, 50, 53, 52, 53, 56, 55, 56, 59, 58, 75, 70, 69, 72, 67, 66, 65, 68, 67, 72, 71, 70, 71, 80, 81, 78]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.