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.

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

Table of values

n a(n)
0 1
1 0
2 3
3 2408
4 1
5 3976
6 608
7 28
8 1
9 88
10 23
11 464658
12 1
13 319924724
14 3
15 7
16 1
17 1628
18 138
19 2219409
20 1
21 6
22 5
23 594
24 1
25 872
26 3
27 92
28 1
29 392
30 65
31 2278155
32 1
33 3755866
34 4793
35 13
36 1
37 7873
38 3
39 614294
40 1
41 448812437
42 5

List of values

[1, 0, 3, 2408, 1, 3976, 608, 28, 1, 88, 23, 464658, 1, 319924724, 3, 7, 1, 1628, 138, 2219409, 1, 6, 5, 594, 1, 872, 3, 92, 1, 392, 65, 2278155, 1, 3755866, 4793, 13, 1, 7873, 3, 614294, 1, 448812437, 5]