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.

A186713 For the starting base k = A118119(n), a(n) is the largest value q such that gcd(k^n+1, (k+1)^n+1, ..., (k+q)^n+1) > 1.

Table of values

n a(n)
2 1
3 1
4 1
5 2
6 1
7 2
8 2
9 1
10 1
11 1
12 1
13 1
14 1
15 2
16 1
17 1
18 1
19 1
20 1
21 1
22 1
23 1
24 1
25 2
26 1
27 1
28 1
29 1
30 1
31 2
32 1
33 1
34 1
35 2
36 1
37 1
38 1
39 1
40 2
41 1
42 1
43 1
44 1
45 1
46 1
47 1
48 1
49 2
50 1
51 1
52 1
53 3
54 1
55 2
56 2
57 1
58 1
59 1
60 1
61 1
62 1
63 1
64 1
65 1
66 1
67 1
68 1
69 1
70 1
71 1
72 1
73 1
74 1
75 2
76 1
77 2

List of values

[1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.