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.

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

Table of values

n a(n)
0 1
1 0
2 1
3 5
4 1
5 5238149
6 1
7 24747
8 1
9 5
10 1
11 1042068640211853141849723
12 1
13 28913777
14 1
15 5
16 1
17 9380
18 1
19 87940
20 1
21 5
22 1
23 677083547
24 1
25 1584
26 1
27 5
28 1
29 5355
30 1
31 257
32 1
33 5
34 1
35 118
36 1
37 3250
38 1
39 5
40 1
41 78609080
42 1
43 1807714890
44 1
45 5
46 1

List of values

[1, 0, 1, 5, 1, 5238149, 1, 24747, 1, 5, 1, 1042068640211853141849723, 1, 28913777, 1, 5, 1, 9380, 1, 87940, 1, 5, 1, 677083547, 1, 1584, 1, 5, 1, 5355, 1, 257, 1, 5, 1, 118, 1, 3250, 1, 5, 1, 78609080, 1, 1807714890, 1, 5, 1]