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.

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

Table of values

n a(n)
1 19601
2 22049
3 54568
4 48149
5 57968
6 13543
7 52057
8 132857
9 101399
10 296449
11 67357
12 171793
13 132576
14 298117
15 3414284
16 84457
17 223568
18 296449
19 380827
20 4029059
21 14380864
22 85193
23 261593
24 338168
25 1096112
26 7040291
27 14461231
28 3727271
29 93493
30 282907
31 1098599
32 1761679

List of values

[19601, 22049, 54568, 48149, 57968, 13543, 52057, 132857, 101399, 296449, 67357, 171793, 132576, 298117, 3414284, 84457, 223568, 296449, 380827, 4029059, 14380864, 85193, 261593, 338168, 1096112, 7040291, 14461231, 3727271, 93493, 282907, 1098599, 1761679]