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.

A308261 For any integer n, let d(n) be the smallest k > 0 such that at least one of n-k or n+k is a prime number; we build an undirected graph G on top of the prime numbers as follows: two consecutive prime numbers p and q are connected iff at least one of d(p) or d(q) equals q-p; a(n) is the number of terms in the n-th connected component of G (ordered by least element).

Table of values

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

List of values

[4, 2, 3, 2, 7, 3, 3, 3, 3, 2, 2, 8, 2, 7, 2, 5, 4, 4, 2, 4, 5, 3, 2, 2, 3, 4, 3, 3, 2, 2, 5, 8, 7, 4, 2, 5, 3, 2, 2, 2, 2, 3, 4, 4, 3, 5, 4, 2, 2, 2, 3, 2, 3, 6, 3, 2, 2, 4, 6, 2, 3, 2, 4, 3, 4, 2, 5, 4, 3, 7, 4, 2, 2, 2, 3, 4, 4, 4, 2, 5, 4, 2, 2, 5, 3, 3, 2]