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.

A127438 Minimal nonnegative solution to 2^x == 3 (mod p) where p goes over primes for which such a solution exists (A001915).

Table of values

n a(n)
1 0
2 3
3 8
4 4
5 13
6 8
7 5
8 26
9 19
10 17
11 50
12 6
13 39
14 16
15 72
16 19
17 69
18 70
19 72
20 41
21 87
22 101
23 48
24 27
25 108
26 56
27 89
28 42
29 181
30 43
31 46
32 48
33 83
34 109
35 157
36 93
37 92
38 56
39 249
40 152
41 26
42 69
43 238
44 137
45 184
46 271
47 11
48 100
49 404
50 13
51 318
52 111
53 450
54 25
55 320
56 151
57 130
58 9
59 297
60 104
61 429
62 435
63 530
64 105
65 478
66 175
67 114
68 75
69 175
70 80

List of values

[0, 3, 8, 4, 13, 8, 5, 26, 19, 17, 50, 6, 39, 16, 72, 19, 69, 70, 72, 41, 87, 101, 48, 27, 108, 56, 89, 42, 181, 43, 46, 48, 83, 109, 157, 93, 92, 56, 249, 152, 26, 69, 238, 137, 184, 271, 11, 100, 404, 13, 318, 111, 450, 25, 320, 151, 130, 9, 297, 104, 429, 435, 530, 105, 478, 175, 114, 75, 175, 80]