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.

A214228 a(n) = gcd(r,2*n+1) where r is 1 + (A143608(i-1) mod (2*n+1)) and A143608(i) is the first zero mod 2*n+1 other than i=0.

Table of values

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

List of values

[1, 1, 1, 1, 1, 1, 5, 1, 1, 7, 1, 1, 1, 1, 1, 1, 7, 1, 13, 1, 1, 5, 1, 1, 3, 1, 5, 1, 1, 1, 7, 1, 1, 23, 1, 1, 25, 7, 1, 1, 1, 5, 29, 1, 7, 31, 5, 1, 1, 1, 1, 35, 1, 1, 37, 1, 23, 13, 7, 1, 41, 1, 1, 1, 1, 7, 5, 1, 1, 47, 13, 1, 49, 1, 1, 9, 31, 1, 53]