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.

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

Table of values

n a(n)
1 17
2 37
3 26
4 53
5 82
6 18
7 73
8 107
9 68
10 148
11 89
12 118
13 99
14 215
15 239
16 109
17 143
18 226
19 362
20 360
21 249
22 125
23 199
24 276
25 606
26 485
27 577
28 423
29 145
30 224
31 293
32 717
33 596
34 653
35 653
36 28
37 161
38 226
39 324
40 753
41 606
42 868
43 2098
44 784
45 63
46 181
47 251
48 374
49 766
50 699
51 1520
52 2526
53 1921
54 571

List of values

[17, 37, 26, 53, 82, 18, 73, 107, 68, 148, 89, 118, 99, 215, 239, 109, 143, 226, 362, 360, 249, 125, 199, 276, 606, 485, 577, 423, 145, 224, 293, 717, 596, 653, 653, 28, 161, 226, 324, 753, 606, 868, 2098, 784, 63, 181, 251, 374, 766, 699, 1520, 2526, 1921, 571]