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.

A276317 a(n) = b(n)/c(n) where b(n) = smallest positive k such that (2*k)^2 + 2*n - 1 is prime and c(n) = gcd(n,3) = A109007(n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 1, 1, 4, 1, 2, 1, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 2, 4, 2, 2, 1, 2, 1, 4, 1, 1, 1, 1, 5, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 2, 2, 1, 5, 2, 1, 1, 3, 2, 2, 3, 1, 1, 1, 1]