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.

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

Table of values

n a(n)
0 1
1 0
2 1
3 1925
4 1
5 189812175
6 1
7 2
8 1
9 116
10 1
11 55508752881180794569675021
12 1
13 337276
14 1
15 230
16 1
17 162
18 1
19 2628
20 1
21 15
22 1
23 3604979675443168377172749
24 1
25 53
26 1
27 248
28 1
29 254
30 1
31 5998484614
32 1
33 1323
34 1
35 2
36 1
37 42750021
38 1
39 51
40 1
41 17870
42 1
43 108
44 1
45 87
46 1
47 8274
48 1
49 2
50 1
51 35
52 1
53 4049
54 1
55 308
56 1
57 8885
58 1
59 2805086
60 1

List of values

[1, 0, 1, 1925, 1, 189812175, 1, 2, 1, 116, 1, 55508752881180794569675021, 1, 337276, 1, 230, 1, 162, 1, 2628, 1, 15, 1, 3604979675443168377172749, 1, 53, 1, 248, 1, 254, 1, 5998484614, 1, 1323, 1, 2, 1, 42750021, 1, 51, 1, 17870, 1, 108, 1, 87, 1, 8274, 1, 2, 1, 35, 1, 4049, 1, 308, 1, 8885, 1, 2805086, 1]