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.

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

Table of values

n a(n)
1 557
2 901
3 1207
4 1549
5 4607
6 1451
7 2449
8 5176
9 2774
10 13543
11 4049
12 10124
13 8201
14 42269
15 24675
16 5293
17 19601
18 13543
19 91110
20 45124
21 39016
22 5849
23 20924
24 24482
25 91678
26 95236
27 302947
28 217682
29 6193
30 22049
31 30949
32 101399
33 188872
34 387587
35 928423
36 165407
37 7057
38 26018

List of values

[557, 901, 1207, 1549, 4607, 1451, 2449, 5176, 2774, 13543, 4049, 10124, 8201, 42269, 24675, 5293, 19601, 13543, 91110, 45124, 39016, 5849, 20924, 24482, 91678, 95236, 302947, 217682, 6193, 22049, 30949, 101399, 188872, 387587, 928423, 165407, 7057, 26018]