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.

A364883 Consider the Fermat quotient for base n: Fq(n,k) = (n^(p - 1) - 1)/p, where p = prime(k), for k >= 1. a(n) is the least k >= 1 such that Fq(n,j) is divisible by n^2 - 1 for all j >= k.

Table of values

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

List of values

[3, 3, 4, 4, 5, 5, 5, 4, 6, 6, 7, 7, 7, 5, 8, 8, 9, 9, 9, 6, 10, 10, 10, 7, 7, 7, 11, 11, 12, 12, 12, 8, 8, 8, 13, 13, 13, 9, 14, 14, 15, 15, 15, 10, 16, 16, 16, 5, 8, 8, 17, 17, 17, 6, 9, 11, 18, 18, 19, 19, 19, 12, 7, 7, 20, 20, 20, 10, 21, 21, 22, 22, 22, 13, 9, 9, 23, 23, 23]