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.

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

Table of values

n a(n)
0 1
1 0
2 26
3 1
4 5
5 24308100
6 1
7 329
8 71
9 1
10 6
11 59
12 1
13 135
14 5
15 1
16 23
17 7711
18 1
19 82
20 6
21 1
22 8
23 320594291825643656342
24 1
25 45
26 10
27 1
28 755
29 1107
30 1
31 4279
32 30269
33 1
34 5
35 205961
36 1
37 259
38 8
39 1
40 9
41 101975
42 1
43 6491
44 5
45 1
46 8

List of values

[1, 0, 26, 1, 5, 24308100, 1, 329, 71, 1, 6, 59, 1, 135, 5, 1, 23, 7711, 1, 82, 6, 1, 8, 320594291825643656342, 1, 45, 10, 1, 755, 1107, 1, 4279, 30269, 1, 5, 205961, 1, 259, 8, 1, 9, 101975, 1, 6491, 5, 1, 8]