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.

A332084 Triangle read by rows: T(n,k) is the smallest m >= 0 such that floor(Pi*n^m) == k (mod n), -1 if one does not exist, k = 0..n-1.

Table of values

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

List of values

[0, 1, 0, 0, 2, 4, 1, 3, 2, 0, 1, 7, 3, 0, 8, 1, 9, 14, 0, 10, 2, 1, 7, 10, 0, 8, 6, 2, 3, 1, 8, 0, 9, 6, 14, 5, 10, 1, 2, 0, 3, 20, 18, 11, 5, 32, 1, 6, 0, 2, 4, 7, 13, 11, 5, 5, 1, 8, 0, 13, 4, 2, 6, 9, 24, 12, 5, 1, 22, 0, 3, 17, 14, 18, 2, 6, 20, 10, 5, 1, 10, 0, 6, 9, 17, 14, 23, 7, 2, 21, 3]