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.

A372799 Smallest prime p such that the multiplicative order of 9 modulo p is 2*n, or 0 if no such prime exists.

Table of values

n a(n)
1 5
2 13
3 67
4 313
5 41
6 61
7 883
8 433
9 271
10 2161
11 683
12 193
13 1223
14 8317
15 2131
16 769
17 2551
18 1621
19 8513
20 2521
21 8779
22 4357
23 5843
24 3889
25 7451
26 16069
27 3079
28 19993
29 14327
30 661
31 23747
32 95617
33 42703
34 2857
35 15401
36 17209
37 2887
38 7297
39 547
40 13441
41 4019
42 757
43 41453
44 29833
45 54631
46 31741
47 20399

List of values

[5, 13, 67, 313, 41, 61, 883, 433, 271, 2161, 683, 193, 1223, 8317, 2131, 769, 2551, 1621, 8513, 2521, 8779, 4357, 5843, 3889, 7451, 16069, 3079, 19993, 14327, 661, 23747, 95617, 42703, 2857, 15401, 17209, 2887, 7297, 547, 13441, 4019, 757, 41453, 29833, 54631, 31741, 20399]

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

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