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.

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

Table of values

n a(n)
0 1
1 0
2 20
3 3
4 2
5 3
6 320
7 874
8 6
9 33
10 1
11 124
12 465
13 23433448460229
14 81920
15 3
16 2
17 82
18 65
19 2101
20 1
21 3
22 3
23 2398892314
24 7270
25 3
26 11
27 21
28 2
29 97546469
30 1
31 765170730
32 6
33 15
34 3
35 3
36 23
37 370460325141871548
38 29206018
39 3
40 1

List of values

[1, 0, 20, 3, 2, 3, 320, 874, 6, 33, 1, 124, 465, 23433448460229, 81920, 3, 2, 82, 65, 2101, 1, 3, 3, 2398892314, 7270, 3, 11, 21, 2, 97546469, 1, 765170730, 6, 15, 3, 3, 23, 370460325141871548, 29206018, 3, 1]