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.

A143663 a(n) is the least prime such that the multiplicative order of 3 mod a(n) equals n, or a(n)=1 if no such prime exists.

Table of values

n a(n)
1 2
2 1
3 13
4 5
5 11
6 7
7 1093
8 41
9 757
10 61
11 23
12 73
13 797161
14 547
15 4561
16 17
17 1871
18 19
19 1597
20 1181
21 368089
22 67
23 47
24 6481
25 8951
26 398581
27 109
28 29
29 59
30 31
31 683
32 21523361
33 2413941289
34 103
35 71
36 530713
37 13097927
38 2851
39 313
40 42521761
41 83
42 43
43 431
44 5501
45 181
46 23535794707

List of values

[2, 1, 13, 5, 11, 7, 1093, 41, 757, 61, 23, 73, 797161, 547, 4561, 17, 1871, 19, 1597, 1181, 368089, 67, 47, 6481, 8951, 398581, 109, 29, 59, 31, 683, 21523361, 2413941289, 103, 71, 530713, 13097927, 2851, 313, 42521761, 83, 43, 431, 5501, 181, 23535794707]