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.

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

Table of values

n a(n)
0 1
1 0
2 18
3 533
4 1
5 32
6 288
7 484
8 1
9 364
10 6
11 176427
12 1
13 31239
14 533
15 8
16 1
17 8424432925592889329288197322308900672459420460792433
18 30
19 16561
20 1
21 4
22 6
23 349
24 1
25 32
26 546
27 2579
28 1
29 375766
30 11
31 5061867704425915
32 1
33 5620
34 6
35 8
36 1

List of values

[1, 0, 18, 533, 1, 32, 288, 484, 1, 364, 6, 176427, 1, 31239, 533, 8, 1, 8424432925592889329288197322308900672459420460792433, 30, 16561, 1, 4, 6, 349, 1, 32, 546, 2579, 1, 375766, 11, 5061867704425915, 1, 5620, 6, 8, 1]