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.

A032448 Smallest prime == -1 modulo prime(n).

Table of values

n a(n)
1 3
2 2
3 19
4 13
5 43
6 103
7 67
8 37
9 137
10 173
11 61
12 73
13 163
14 257
15 281
16 211
17 353
18 487
19 401
20 283
21 1021
22 157
23 331
24 1423
25 193
26 1009
27 617
28 641
29 653
30 677
31 761
32 523
33 547
34 277
35 1489
36 1811
37 313
38 977
39 1669
40 691
41 1789
42 1447
43 4201
44 1543
45 787
46 397
47 421
48 1783
49 907
50 457

List of values

[3, 2, 19, 13, 43, 103, 67, 37, 137, 173, 61, 73, 163, 257, 281, 211, 353, 487, 401, 283, 1021, 157, 331, 1423, 193, 1009, 617, 641, 653, 677, 761, 523, 547, 277, 1489, 1811, 313, 977, 1669, 691, 1789, 1447, 4201, 1543, 787, 397, 421, 1783, 907, 457]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.