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.

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

Table of values

n a(n)
0 1
1 0
2 6
3 56
4 3
5 29
6 96
7 1159823
8 384
9 9
10 3
11 1994117680
12 13
13 247
14 6
15 15
16 3
17 1256
18 4
19 25211925041
20 15
21 5785
22 3
23 93602696971
24 24
25 11
26 6
27 182
28 3
29 4644
30 92
31 12506
32 9
33 13
34 3
35 484
36 2
37 420
38 6
39 130
40 3
41 16032496
42 12

List of values

[1, 0, 6, 56, 3, 29, 96, 1159823, 384, 9, 3, 1994117680, 13, 247, 6, 15, 3, 1256, 4, 25211925041, 15, 5785, 3, 93602696971, 24, 11, 6, 182, 3, 4644, 92, 12506, 9, 13, 3, 484, 2, 420, 6, 130, 3, 16032496, 12]