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.

A214229 a(n) equals gcd(r,2*n+1) where r is 1 + (A143608(i+1) mod (2*n+1)) where A143608(i) is the first zero mod 2n+1 other than 0.

Table of values

n a(n)
1 3
2 5
3 1
4 9
5 11
6 13
7 3
8 17
9 19
10 3
11 1
12 25
13 27
14 29
15 1
16 33
17 5
18 37
19 3
20 1
21 43
22 9
23 1
24 1
25 17
26 53
27 11
28 57
29 59
30 61
31 9
32 65
33 67
34 3
35 1
36 73
37 3
38 11
39 1
40 81
41 83
42 17
43 3
44 89
45 13
46 3
47 19
48 97
49 99
50 101
51 1
52 3
53 107
54 109
55 3
56 113
57 5
58 9
59 17
60 121
61 3
62 125
63 1
64 129
65 131
66 19

List of values

[3, 5, 1, 9, 11, 13, 3, 17, 19, 3, 1, 25, 27, 29, 1, 33, 5, 37, 3, 1, 43, 9, 1, 1, 17, 53, 11, 57, 59, 61, 9, 65, 67, 3, 1, 73, 3, 11, 1, 81, 83, 17, 3, 89, 13, 3, 19, 97, 99, 101, 1, 3, 107, 109, 3, 113, 5, 9, 17, 121, 3, 125, 1, 129, 131, 19]