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.

A168171 Least prime p = 1 (mod n) which divides Fibonacci((p-1)/n).

Table of values

n a(n)
1 11
2 29
3 139
4 61
5 211
6 541
7 2269
8 89
9 199
10 281
11 859
12 661
13 911
14 2269
15 2221
16 2081
17 2789
18 2161
19 3041
20 421
21 2521
22 19009
23 21529
24 3001
25 9901
26 5981
27 2161
28 2269
29 26449
30 2221
31 31249
32 19681
33 17491
34 2789
35 3571
36 25309
37 30859
38 3041
39 6709
40 3001
41 9349
42 2521
43 13159
44 19009

List of values

[11, 29, 139, 61, 211, 541, 2269, 89, 199, 281, 859, 661, 911, 2269, 2221, 2081, 2789, 2161, 3041, 421, 2521, 19009, 21529, 3001, 9901, 5981, 2161, 2269, 26449, 2221, 31249, 19681, 17491, 2789, 3571, 25309, 30859, 3041, 6709, 3001, 9349, 2521, 13159, 19009]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.