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.

A204897 a(n) = (p(n)-q(n))/n, where (p(n), q(n)) is the least pair of primes for which n divides p(n)-q(n).

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1]