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.

A254309 Irregular triangular array read by rows: T(n,k) is the least positive primitive root of the n-th prime p=prime(n) raised to successive powers of k (mod p) where 1<=k<=p-1 and gcd(k,p-1)=1.

Table of values

n a(n)
1 1
2 2
3 2
4 3
5 3
6 5
7 2
8 8
9 7
10 6
11 2
12 6
13 11
14 7
15 3
16 10
17 5
18 11
19 14
20 7
21 12
22 6
23 2
24 13
25 14
26 15
27 3
28 10
29 5
30 10
31 20
32 17
33 11
34 21
35 19
36 15
37 7
38 14
39 2
40 8
41 3
42 19
43 18
44 14
45 27
46 21
47 26
48 10
49 11
50 15
51 3
52 17
53 13
54 24
55 22
56 12
57 11
58 21
59 2
60 32
61 17
62 13
63 15
64 18
65 35
66 5
67 20
68 24
69 22
70 19

List of values

[1, 2, 2, 3, 3, 5, 2, 8, 7, 6, 2, 6, 11, 7, 3, 10, 5, 11, 14, 7, 12, 6, 2, 13, 14, 15, 3, 10, 5, 10, 20, 17, 11, 21, 19, 15, 7, 14, 2, 8, 3, 19, 18, 14, 27, 21, 26, 10, 11, 15, 3, 17, 13, 24, 22, 12, 11, 21, 2, 32, 17, 13, 15, 18, 35, 5, 20, 24, 22, 19]