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.

A245526 Unique integer r with -prime(n)/2 < r <= prime(n)/2 such that L(2*n) == r (mod prime(n)), where L(k) denotes the Lucas number A000032(k).

Table of values

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

List of values

[1, 1, -2, -2, 2, -3, -7, 3, 5, -11, -15, 8, -18, -14, 3, -12, 19, -18, 25, 14, 5, 21, 11, 7, -22, 3, 43, -40, -7, -53, 54, 23, 11, -12, -7, 41, 6, -13, -66, 71, -32, 18, 94, -20, -79, 7, -88, 12, 11, -73, 3, 29, -120, 50, 10, -60, -63, 34, 94, 47, -113, 131, -18, 128, 60, 57, 79, 22, -45, -68, 100, 100, 131, -171, 56, -166, 11, -153, -174, 10]