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.

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

Table of values

n a(n)
1 4486949
2 4651993
3 20950343
4 4941649
5 21184318
6 23250274
7 5571593
8 33538051
9 163075007
10 741652533
11 11903257
12 78868324
13 189850207
14 882345432
15 710808570
16 19397501
17 86892632
18 230695118
19 1528112512
20 5126829291
21 2380570527
22 19841257
23 111899224
24 421883318
25 1701241810

List of values

[4486949, 4651993, 20950343, 4941649, 21184318, 23250274, 5571593, 33538051, 163075007, 741652533, 11903257, 78868324, 189850207, 882345432, 710808570, 19397501, 86892632, 230695118, 1528112512, 5126829291, 2380570527, 19841257, 111899224, 421883318, 1701241810]