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.

A168172 Least prime p == -1 (mod n) that divides Fibonacci((p+1)/n), or 0 if no such prime exists.

Table of values

n a(n)
1 2
2 13
3 47
4 0
5 0
6 113
7 307
8 0
9 233
10 0
11 967
12 0
13 2417
14 797
15 0
16 0
17 1087
18 233
19 5737
20 0
21 5417
22 5653
23 1103
24 0
25 0
26 2417
27 4373
28 0
29 6263
30 0
31 25357
32 0
33 3167
34 42533
35 0
36 0
37 4513
38 5737
39 2417
40 0
41 61417
42 5417
43 32507
44 0
45 0
46 36017
47 1597
48 0
49 97607
50 0
51 27947
52 0
53 42293
54 4373
55 0
56 0

List of values

[2, 13, 47, 0, 0, 113, 307, 0, 233, 0, 967, 0, 2417, 797, 0, 0, 1087, 233, 5737, 0, 5417, 5653, 1103, 0, 0, 2417, 4373, 0, 6263, 0, 25357, 0, 3167, 42533, 0, 0, 4513, 5737, 2417, 0, 61417, 5417, 32507, 0, 0, 36017, 1597, 0, 97607, 0, 27947, 0, 42293, 4373, 0, 0]