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.

A066220 Least k > 0 such that t^k = 1 mod (prime(n) - t) for 0 < t < prime(n).

Table of values

n a(n)
1 1
2 1
3 2
4 4
5 6
6 60
7 60
8 120
9 144
10 7920
11 55440
12 18480
13 7920
14 27720
15 2520
16 637560
17 8288280
18 480720240
19 480720240
20 480720240
21 480720240
22 480720240
23 1442160720
24 9854764920
25 59128589520
26 59128589520
27 147821473800
28 670124014560

List of values

[1, 1, 2, 4, 6, 60, 60, 120, 144, 7920, 55440, 18480, 7920, 27720, 2520, 637560, 8288280, 480720240, 480720240, 480720240, 480720240, 480720240, 1442160720, 9854764920, 59128589520, 59128589520, 147821473800, 670124014560]