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.

A319063 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..5, with k running over the positive integers; square array, read by antidiagonals, downwards.

Table of values

n a(n)
1 132857
2 171793
3 2006776
4 261593
5 3091832
6 296449
7 618301
8 3420818
9 9654224
10 17134811
11 700993
12 3524932
13 11002557
14 23250274
15 36763941
16 997757
17 4108582
18 16616568
19 26073470
20 195603158
21 34998229
22 1211201
23 4349699
24 20512643
25 26646377
26 307849316
27 71724464

List of values

[132857, 171793, 2006776, 261593, 3091832, 296449, 618301, 3420818, 9654224, 17134811, 700993, 3524932, 11002557, 23250274, 36763941, 997757, 4108582, 16616568, 26073470, 195603158, 34998229, 1211201, 4349699, 20512643, 26646377, 307849316, 71724464]