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.

A241014 Let p be the n-th prime, then a(n) = A/p where A is the smallest number (in absolute value) such that F_{p-(p/5)} == A (mod p^2) with F_n = A000045(n) and (p/5) the Legendre symbol.

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 5
6 3
7 -1
8 3
9 -8
10 -3
11 -6
12 13
13 -2
14 -4
15 16
16 -25
17 10
18 -13
19 7
20 -16
21 -15
22 -30
23 21
24 5
25 37
26 -4
27 22
28 24
29 26
30 -53
31 13
32 64
33 58
34 -22
35 -29
36 60
37 44
38 -3
39 44
40 -43
41 -5
42 -50
43 94
44 31
45 -56
46 5
47 -99
48 3
49 -73
50 18
51 29
52 5
53 -59
54 -1
55 2

List of values

[1, 1, 1, 3, 5, 3, -1, 3, -8, -3, -6, 13, -2, -4, 16, -25, 10, -13, 7, -16, -15, -30, 21, 5, 37, -4, 22, 24, 26, -53, 13, 64, 58, -22, -29, 60, 44, -3, 44, -43, -5, -50, 94, 31, -56, 5, -99, 3, -73, 18, 29, 5, -59, -1, 2]