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.

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

Table of values

n a(n)
0 1
1 0
2 8
3 210
4 1
5 82
6 128
7 4763358550
8 1
9 22
10 8
11 4050643070777669523228
12 1
13 1010633974733
14 7784
15 100
16 1
17 26627469676193276478340
18 8
19 179
20 1
21 4082
22 48
23 1293523748876425462850
24 1
25 173
26 8
27 5
28 1
29 2423
30 320
31 342
32 1
33 1162
34 8
35 93
36 1
37 455207
38 128
39 22
40 1
41 11383
42 8
43 58768
44 1
45 91
46 96
47 306824898
48 1
49 187751
50 8
51 84
52 1

List of values

[1, 0, 8, 210, 1, 82, 128, 4763358550, 1, 22, 8, 4050643070777669523228, 1, 1010633974733, 7784, 100, 1, 26627469676193276478340, 8, 179, 1, 4082, 48, 1293523748876425462850, 1, 173, 8, 5, 1, 2423, 320, 342, 1, 1162, 8, 93, 1, 455207, 128, 22, 1, 11383, 8, 58768, 1, 91, 96, 306824898, 1, 187751, 8, 84, 1]