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.

A244801 Smallest m such that for the prime p = prime(n) the congruence F_(p-(p/5)) == mp (mod p^2) holds (i.e., smallest m such that prime(n) is a near-Wall-Sun-Sun prime), where F_k is the k-th Fibonacci number and (p/5) is the Legendre symbol.

Table of values

n a(n)
1 1
2 1
3 1
4 3
5 5
6 3
7 16
8 3
9 15
10 26
11 25
12 13
13 39
14 39
15 16
16 28
17 10
18 48
19 7
20 55
21 58
22 49
23 21
24 5
25 37
26 97
27 22
28 24
29 26
30 60
31 13
32 64
33 58
34 117
35 120
36 60
37 44
38 160
39 44
40 130
41 174
42 131
43 94
44 31
45 141
46 5
47 112
48 3
49 154
50 18
51 29
52 5
53 182
54 250
55 2
56 105

List of values

[1, 1, 1, 3, 5, 3, 16, 3, 15, 26, 25, 13, 39, 39, 16, 28, 10, 48, 7, 55, 58, 49, 21, 5, 37, 97, 22, 24, 26, 60, 13, 64, 58, 117, 120, 60, 44, 160, 44, 130, 174, 131, 94, 31, 141, 5, 112, 3, 154, 18, 29, 5, 182, 250, 2, 105]