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.

A385166 Let p = A002145(n) be the n-th prime == 3 (mod 4); a(n) = (p+1) * ord(5,p) / ord(2+-i,p) = (p+1) * ord(5,p) / A385165(n). Here ord(a,m) is the multiplicative order of a modulo m.

Table of values

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

List of values

[1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 1, 1, 1, 2, 5, 1, 1, 1, 1, 3, 2, 2, 1, 1, 2, 2, 1, 1, 1, 11, 1, 4, 3, 10, 1, 1, 1, 3, 1, 2, 1, 1, 1, 6, 1, 6, 1, 3, 1, 1, 1, 4, 3, 24, 1, 1, 1, 1, 1, 3, 1, 4, 2, 1, 1, 1, 1, 1, 2, 1, 1, 8, 1, 27, 1, 1, 1, 1, 20, 3, 1, 4, 1, 1]