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.

A249778 a(1)=2; thereafter, a(n) is the smallest number not occurring earlier such that Kronecker(a(k), a(n)) = 1 for the next n indices k = n+1, n+2, ..., 2n.

Table of values

n a(n)
1 2
2 7
3 3
4 4
5 11
6 25
7 9
8 19
9 16
10 49
11 17
12 59
13 67
14 121
15 81
16 169
17 43
18 115
19 64
20 191
21 293
22 361
23 289
24 587
25 269
26 841
27 863
28 961
29 1031
30 1369
31 441
32 1681
33 1867
34 2209
35 1849
36 2809
37 65
38 529
39 256
40 643
41 3481
42 3517
43 1639
44 1877
45 3721
46 4489
47 5041
48 5329
49 5591
50 6241
51 3557
52 6889
53 7921

List of values

[2, 7, 3, 4, 11, 25, 9, 19, 16, 49, 17, 59, 67, 121, 81, 169, 43, 115, 64, 191, 293, 361, 289, 587, 269, 841, 863, 961, 1031, 1369, 441, 1681, 1867, 2209, 1849, 2809, 65, 529, 256, 643, 3481, 3517, 1639, 1877, 3721, 4489, 5041, 5329, 5591, 6241, 3557, 6889, 7921]