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.

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

Table of values

n a(n)
1 126664001
2 133487693
3 230695118
4 141313157
5 633266299
6 882345432
7 236176001
8 1221760151
9 1986592318
10 12106746963
11 242883757
12 1575527851
13 2715632968
14 12709975396
15 93732236423
16 356977349
17 1881738424
18 3726163057
19 38456038702
20 122728381675
21 66888229817

List of values

[126664001, 133487693, 230695118, 141313157, 633266299, 882345432, 236176001, 1221760151, 1986592318, 12106746963, 242883757, 1575527851, 2715632968, 12709975396, 93732236423, 356977349, 1881738424, 3726163057, 38456038702, 122728381675, 66888229817]