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.

A308660 For any Gaussian integer z, let d(z) be the distance from z to the nearest Gaussian prime distinct from z; we build an undirected graph G on top of the Gaussian prime numbers as follows: two Gaussian prime numbers p and q are connected iff at least one of d(p) or d(q) equals the distance from p to q; a(n) is the number of elements in the connected component of G containing A002145(n).

Table of values

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

List of values

[100, 100, 3, 3, 3, 15, 48, 48, 9, 19, 5, 18, 18, 3, 17, 7, 41, 7, 17, 3, 3, 3, 9, 31, 3, 6, 6, 3, 11, 33, 3, 3, 9, 5, 13, 3, 15, 7, 23, 7, 3, 3, 3, 3, 5, 3, 13, 3, 3, 5, 11, 15, 3, 9, 3, 25, 19, 29, 23, 13, 3, 3, 5, 5, 3, 7, 15, 3, 25, 3, 7, 5, 3, 5, 3, 3, 3]