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.

A255861 Least m > 0 such that gcd(m^n+11, (m+1)^n+11) > 1, or 0 if there is no such m.

Table of values

n a(n)
0 1
1 0
2 1
3 2
4 1
5 23
6 1
7 19010820161
8 1
9 7
10 1
11 360
12 1
13 41953103
14 1
15 4
16 1
17 638386957517954762853
18 1
19 38884
20 1
21 2
22 1
23 2852
24 1
25 23
26 1
27 102
28 1
29 8384
30 1
31 36556
32 1
33 33
34 1
35 37
36 1
37 336
38 1
39 2
40 1
41 1123
42 1
43 19734
44 1
45 9
46 1
47 135356
48 1
49 399351
50 1
51 33
52 1

List of values

[1, 0, 1, 2, 1, 23, 1, 19010820161, 1, 7, 1, 360, 1, 41953103, 1, 4, 1, 638386957517954762853, 1, 38884, 1, 2, 1, 2852, 1, 23, 1, 102, 1, 8384, 1, 36556, 1, 33, 1, 37, 1, 336, 1, 2, 1, 1123, 1, 19734, 1, 9, 1, 135356, 1, 399351, 1, 33, 1]