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.

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

Table of values

n a(n)
0 1
1 0
2 30
3 5
4 120
5 133
6 15
7 14
8 11
9 5
10 7680
11 968
12 18
13 243
14 26
15 5
16 9
17 1844434621273219148118716000949433592399169477194046126
18 8
19 22173201293492286974730770140
20 51
21 5
22 593
23 5885
24 41
25 112
26 15
27 5
28 23

List of values

[1, 0, 30, 5, 120, 133, 15, 14, 11, 5, 7680, 968, 18, 243, 26, 5, 9, 1844434621273219148118716000949433592399169477194046126, 8, 22173201293492286974730770140, 51, 5, 593, 5885, 41, 112, 15, 5, 23]