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.

A270776 Smallest non-Wieferich prime to base n, i.e., smallest prime p such that n^(p-1) != 1 (mod p^2).

Table of values

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

List of values

[2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 5, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 5, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 5, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 5, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2, 3, 2, 2, 2]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.