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.

A255855 Least k > 0 such that gcd(k^n+5, (k+1)^n+5) > 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 533360
6 1
7 55
8 1
9 7
10 1
11 796479131355665831357
12 1
13 41
14 1
15 5
16 1
17 3775
18 1
19 42296
20 1
21 7
22 1
23 653246700175064613889
24 1
25 21
26 1
27 5
28 1
29 1619
30 1
31 42842
32 1
33 7
34 1
35 2945
36 1
37 323371
38 1
39 5
40 1
41 1102221
42 1
43 633524110177
44 1
45 7
46 1

List of values

[1, 0, 1, 5, 1, 533360, 1, 55, 1, 7, 1, 796479131355665831357, 1, 41, 1, 5, 1, 3775, 1, 42296, 1, 7, 1, 653246700175064613889, 1, 21, 1, 5, 1, 1619, 1, 42842, 1, 7, 1, 2945, 1, 323371, 1, 5, 1, 1102221, 1, 633524110177, 1, 7, 1]