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.

A077321 Rearrange primes so as to form a triangle in which n-th row contains the n smallest primes == 1 (mod n) which have not occurred earlier.

Table of values

n a(n)
1 2
2 3
3 5
4 7
5 13
6 19
7 17
8 29
9 37
10 41
11 11
12 31
13 61
14 71
15 101
16 43
17 67
18 73
19 79
20 97
21 103
22 113
23 127
24 197
25 211
26 239
27 281
28 337
29 89
30 137
31 193
32 233
33 241
34 257
35 313
36 353
37 109
38 163
39 181
40 199
41 271
42 307
43 379
44 397
45 433
46 131
47 151
48 191
49 251
50 311
51 331
52 401
53 421
54 431
55 461
56 23
57 419
58 463
59 617

List of values

[2, 3, 5, 7, 13, 19, 17, 29, 37, 41, 11, 31, 61, 71, 101, 43, 67, 73, 79, 97, 103, 113, 127, 197, 211, 239, 281, 337, 89, 137, 193, 233, 241, 257, 313, 353, 109, 163, 181, 199, 271, 307, 379, 397, 433, 131, 151, 191, 251, 311, 331, 401, 421, 431, 461, 23, 419, 463, 617]