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.

A255852 Least k > 0 such that gcd(k^n+2, (k+1)^n+2) > 1, or 0 if there is no such k.

Table of values

n a(n)
0 1
1 0
2 1
3 51
4 1
5 40333
6 1
7 434
8 1
9 16
10 1
11 1234
12 1
13 78607
14 1
15 8310
16 1
17 817172
18 1
19 473
20 1
21 116
22 1
23 22650
24 1
25 736546059
26 1
27 22
28 1
29 1080982
30 1
31 252
32 1
33 7809
34 1
35 644
36 1
37 1786225573
38 1

List of values

[1, 0, 1, 51, 1, 40333, 1, 434, 1, 16, 1, 1234, 1, 78607, 1, 8310, 1, 817172, 1, 473, 1, 116, 1, 22650, 1, 736546059, 1, 22, 1, 1080982, 1, 252, 1, 7809, 1, 644, 1, 1786225573, 1]