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.

A083809 Let f(n) be the smallest prime == 1 mod n (cf. A034694). Sequence gives triangle T(j,k) = f^k(j) for 1 <= k <= j, read by rows.

Table of values

n a(n)
1 2
2 3
3 7
4 7
5 29
6 59
7 5
8 11
9 23
10 47
11 11
12 23
13 47
14 283
15 1699
16 7
17 29
18 59
19 709
20 2837
21 22697
22 29
23 59
24 709
25 2837
26 22697
27 590123
28 1180247
29 17
30 103
31 619
32 2477
33 34679
34 416149
35 7490683
36 29962733
37 19
38 191
39 383
40 4597
41 27583
42 330997
43 9267917
44 74143337
45 1038006719

List of values

[2, 3, 7, 7, 29, 59, 5, 11, 23, 47, 11, 23, 47, 283, 1699, 7, 29, 59, 709, 2837, 22697, 29, 59, 709, 2837, 22697, 590123, 1180247, 17, 103, 619, 2477, 34679, 416149, 7490683, 29962733, 19, 191, 383, 4597, 27583, 330997, 9267917, 74143337, 1038006719]