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.

A301618 Least k > n such that gcd(k+1,n+1) > gcd(k,n) > 1.

Table of values

n a(n)
2 8
3 15
4 14
5 35
6 20
7 63
8 14
9 24
10 32
11 143
12 38
13 195
14 20
15 27
16 50
17 323
18 56
19 399
20 26
21 54
22 68
23 575
24 34
25 90
26 32
27 39
28 86
29 899
30 92
31 1023
32 38
33 84
34 44
35 65
36 110
37 1443
38 44
39 51
40 122
41 1763
42 128
43 1935
44 50
45 114
46 140
47 2303
48 62
49 119
50 56
51 63
52 158
53 2915
54 64
55 90
56 62
57 144
58 176
59 3599
60 182
61 3843

List of values

[8, 15, 14, 35, 20, 63, 14, 24, 32, 143, 38, 195, 20, 27, 50, 323, 56, 399, 26, 54, 68, 575, 34, 90, 32, 39, 86, 899, 92, 1023, 38, 84, 44, 65, 110, 1443, 44, 51, 122, 1763, 128, 1935, 50, 114, 140, 2303, 62, 119, 56, 63, 158, 2915, 64, 90, 62, 144, 176, 3599, 182, 3843]