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.

A070849 Smallest prime == 1 mod (5n).

Table of values

n a(n)
1 11
2 11
3 31
4 41
5 101
6 31
7 71
8 41
9 181
10 101
11 331
12 61
13 131
14 71
15 151
16 241
17 1021
18 181
19 191
20 101
21 211
22 331
23 461
24 241
25 251
26 131
27 271
28 281
29 1451
30 151
31 311
32 641
33 331
34 1021
35 701
36 181
37 1481
38 191
39 1171
40 401
41 821
42 211
43 431
44 661
45 1801
46 461
47 941
48 241
49 491
50 251
51 1021
52 521

List of values

[11, 11, 31, 41, 101, 31, 71, 41, 181, 101, 331, 61, 131, 71, 151, 241, 1021, 181, 191, 101, 211, 331, 461, 241, 251, 131, 271, 281, 1451, 151, 311, 641, 331, 1021, 701, 181, 1481, 191, 1171, 401, 821, 211, 431, 661, 1801, 461, 941, 241, 491, 251, 1021, 521]

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

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