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.

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

Table of values

n a(n)
0 1
1 0
2 2
3 22
4 128
5 12
6 2
7 81
8 1
9 5982
10 2
11 11417025
12 32768
13 70471611388086
14 2
15 26
16 1
17 1019
18 2
19 12168420936538713481747
20 48
21 128
22 2
23 788
24 1
25 131711329
26 2
27 91
28 13
29 2920553219286322570768516629247
30 2
31 237
32 1
33 22
34 2
35 108
36 27
37 9404578
38 2
39 2859801
40 1
41 41772125
42 2

List of values

[1, 0, 2, 22, 128, 12, 2, 81, 1, 5982, 2, 11417025, 32768, 70471611388086, 2, 26, 1, 1019, 2, 12168420936538713481747, 48, 128, 2, 788, 1, 131711329, 2, 91, 13, 2920553219286322570768516629247, 2, 237, 1, 22, 2, 108, 27, 9404578, 2, 2859801, 1, 41772125, 2]