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.

A331698 a(n) = (1/2) * ((greatest prime < (n+1)^2) - (least prime > n^2)) for n >= 2.

Table of values

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

List of values

[1, 1, 3, 1, 5, 4, 6, 7, 6, 6, 9, 10, 13, 12, 13, 12, 14, 15, 19, 18, 18, 15, 21, 21, 25, 20, 26, 17, 23, 27, 28, 31, 30, 31, 35, 33, 32, 37, 34, 33, 35, 36, 34, 43, 39, 42, 45, 33, 45, 45, 48, 45, 53, 42, 46, 55, 49, 51, 56, 53, 60, 52, 60, 60, 63, 64, 61, 53]

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

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