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.

A319060 A(n, k) is the k-th number b > 1 such that b^(prime(n+i)-1) == 1 (mod prime(n+i)^2) for each i = 0..2, with k running over the positive integers; square array, read by antidiagonals, downwards.

Table of values

n a(n)
1 449
2 557
3 226
4 593
5 557
6 1207
7 649
8 901
9 1451
10 606
11 701
12 1126
13 2743
14 1371
15 3469
16 757
17 1207
18 2774
19 1451
20 5938
21 653
22 793
23 1243
24 3657
25 1667
26 7624
27 2098
28 5649
29 901
30 1324
31 4232
32 2175
33 11980
34 4755
35 10538
36 26645
37 1349
38 1549
39 4607
40 2774
41 12248
42 5845
43 11137
44 35973

List of values

[449, 557, 226, 593, 557, 1207, 649, 901, 1451, 606, 701, 1126, 2743, 1371, 3469, 757, 1207, 2774, 1451, 5938, 653, 793, 1243, 3657, 1667, 7624, 2098, 5649, 901, 1324, 4232, 2175, 11980, 4755, 10538, 26645, 1349, 1549, 4607, 2774, 12248, 5845, 11137, 35973]