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.

A335139 a(n) = (prime(n + 1) +- k) / 2 where k is the smallest possible odd number such that a(n) is prime and a(n + 1) >= a(n).

Table of values

n a(n)
1 2
2 3
3 3
4 5
5 7
6 7
7 11
8 11
9 13
10 17
11 19
12 19
13 23
14 23
15 29
16 29
17 31
18 31
19 37
20 37
21 41
22 41
23 43
24 47
25 53
26 53
27 53
28 53
29 59
30 61
31 67
32 67
33 71
34 73
35 73
36 79
37 83
38 83
39 89
40 89
41 89
42 97
43 97
44 97
45 101
46 107
47 113
48 113
49 113
50 113
51 113
52 127
53 127
54 127
55 131
56 137
57 137
58 139
59 139
60 139
61 149

List of values

[2, 3, 3, 5, 7, 7, 11, 11, 13, 17, 19, 19, 23, 23, 29, 29, 31, 31, 37, 37, 41, 41, 43, 47, 53, 53, 53, 53, 59, 61, 67, 67, 71, 73, 73, 79, 83, 83, 89, 89, 89, 97, 97, 97, 101, 107, 113, 113, 113, 113, 113, 127, 127, 127, 131, 137, 137, 139, 139, 139, 149]

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

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