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.

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

Table of values

n a(n)
0 1
1 0
2 14
3 320
4 56
5 675113
6 224
7 13
8 5
9 283
10 33
11 192
12 26
13 242
14 5
15 2
16 10
17 140
18 5
19 50
20 142
21 29
22 18
23 605962
24 11
25 97
26 234881024
27 951
28 5
29 3332537854
30 14

List of values

[1, 0, 14, 320, 56, 675113, 224, 13, 5, 283, 33, 192, 26, 242, 5, 2, 10, 140, 5, 50, 142, 29, 18, 605962, 11, 97, 234881024, 951, 5, 3332537854, 14]