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.

A242860 a(n) is the least k >= 2 such that k is neither a square modulo n nor a primitive root (mod n), or 0 if no such value exists.

Table of values

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

List of values

[0, 2, 0, 2, 6, 2, 3, 2, 10, 2, 5, 6, 2, 2, 0, 2, 8, 2, 2, 2, 22, 2, 5, 2, 3, 2, 12, 2, 6, 2, 2, 6, 2, 2, 6, 2, 2, 2, 3, 2, 2, 2, 2, 10, 46, 2, 6, 2, 2, 2, 23, 2, 2, 2, 2, 2, 58, 2, 8, 6, 2, 2, 2, 2, 3, 2, 2, 2, 14, 2, 7, 2, 2, 2, 2, 2, 12, 2, 3, 3, 82, 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.