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.

A212887 a(n) is the prime p corresponding to the smallest integer k such that k^2 == p (mod prime(n)).

Table of values

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

List of values

[2, 5, 3, 2, 17, 2, 7, 5, 7, 23, 41, 2, 11, 5, 3, 59, 29, 71, 2, 17, 11, 3, 43, 41, 37, 7, 31, 17, 13, 7, 5, 47, 59, 47, 151, 2, 23, 17, 79, 5, 3, 59, 2, 113, 2, 29, 71, 23, 17, 83, 5, 67, 61, 131, 53, 47, 43, 41, 31, 17, 13, 11, 7, 67, 239, 53, 227, 47, 2, 107]

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

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