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.

A186710 a(n) = gcd(k^n + 1, (k+1)^n + 1) for the smallest k at which the GCD exceeds 1.

Table of values

n a(n)
2 5
3 7
4 17
5 11
6 5
7 29
8 17
9 19
10 25
11 23
12 17
13 53
14 145
15 61
16 353
17 137
18 5
19 191
20 41
21 43
22 5
23 47
24 97
25 11
26 265
27 19
28 337
29 59
30 25
31 5953
32 257
33 67
34 5
35 29
36 17
37 223
38 5
39 157
40 17
41 83
42 145
43 173
44 89
45 19
46 5
47 283
48 353
49 29
50 12625
51 307
52 17
53 107
54 5
55 121
56 1921
57 229
58 5
59 709
60 241
61 367
62 5
63 817
64 769
65 521
66 5
67 269
68 137
69 139
70 725
71 853
72 55969
73 293
74 745
75 61
76 17
77 29
78 265

List of values

[5, 7, 17, 11, 5, 29, 17, 19, 25, 23, 17, 53, 145, 61, 353, 137, 5, 191, 41, 43, 5, 47, 97, 11, 265, 19, 337, 59, 25, 5953, 257, 67, 5, 29, 17, 223, 5, 157, 17, 83, 145, 173, 89, 19, 5, 283, 353, 29, 12625, 307, 17, 107, 5, 121, 1921, 229, 5, 709, 241, 367, 5, 817, 769, 521, 5, 269, 137, 139, 725, 853, 55969, 293, 745, 61, 17, 29, 265]