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.

A385164 Let p = A002145(n) be the n-th prime == 3 (mod 4); 8*a(n) is the multiplicative order of 1+-i modulo p in Gaussian integers.

Table of values

n a(n)
1 1
2 3
3 5
4 9
5 11
6 5
7 7
8 23
9 29
10 33
11 35
12 39
13 41
14 51
15 53
16 7
17 65
18 69
19 15
20 81
21 83
22 89
23 95
24 99
25 105
26 37
27 113
28 119
29 25
30 131
31 135
32 47
33 51
34 155
35 15
36 173
37 179
38 183
39 189
40 191
41 209
42 43
43 73
44 221
45 231
46 233
47 239
48 243
49 245
50 83
51 251
52 261
53 273
54 281
55 57
56 293
57 299
58 303
59 309
60 45
61 107
62 323
63 329
64 11
65 115

List of values

[1, 3, 5, 9, 11, 5, 7, 23, 29, 33, 35, 39, 41, 51, 53, 7, 65, 69, 15, 81, 83, 89, 95, 99, 105, 37, 113, 119, 25, 131, 135, 47, 51, 155, 15, 173, 179, 183, 189, 191, 209, 43, 73, 221, 231, 233, 239, 243, 245, 83, 251, 261, 273, 281, 57, 293, 299, 303, 309, 45, 107, 323, 329, 11, 115]