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.

A209877 a(n) = A209874(n)/2: Least m > 0 such that 4*m^2 = -1 modulo the Pythagorean prime A002144(n).

Table of values

n a(n)
1 1
2 4
3 2
4 6
5 3
6 16
7 15
8 25
9 23
10 17
11 11
12 5
13 38
14 49
15 50
16 22
17 14
18 40
19 81
20 56
21 7
22 61
23 72
24 32
25 8
26 41
27 30
28 114
29 69
30 144
31 57
32 74
33 68
34 21
35 52
36 137
37 167
38 10
39 133
40 196
41 127
42 191
43 174
44 24
45 104
46 143
47 26
48 59
49 43
50 12
51 258
52 238
53 289
54 97
55 77
56 252
57 53
58 29
59 13
60 283
61 48
62 190
63 335
64 361
65 31
66 228
67 291
68 159
69 263
70 123
71 260
72 325
73 363
74 247
75 162

List of values

[1, 4, 2, 6, 3, 16, 15, 25, 23, 17, 11, 5, 38, 49, 50, 22, 14, 40, 81, 56, 7, 61, 72, 32, 8, 41, 30, 114, 69, 144, 57, 74, 68, 21, 52, 137, 167, 10, 133, 196, 127, 191, 174, 24, 104, 143, 26, 59, 43, 12, 258, 238, 289, 97, 77, 252, 53, 29, 13, 283, 48, 190, 335, 361, 31, 228, 291, 159, 263, 123, 260, 325, 363, 247, 162]