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.

A114010 a(1) = a(2) = 2, Let k(n) = (prime(n) + prime(n+1))/2. Then a(k(n)) = k(n). a(k(n)-i) = prime(n), a(k(n)+i) = prime(n+1) until the next prime occurs.

Table of values

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

List of values

[2, 2, 3, 4, 5, 6, 7, 7, 9, 11, 11, 12, 13, 13, 15, 17, 17, 18, 19, 19, 21, 23, 23, 23, 23, 26, 29, 29, 29, 30, 31, 31, 31, 34, 37, 37, 37, 37, 39, 41, 41, 42, 43, 43, 45, 47, 47, 47, 47, 50, 53, 53, 53, 53, 53, 56, 59, 59, 59, 60, 61, 61, 61, 64, 67, 67, 67, 67, 69, 71, 71, 72]

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

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