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.

A106535 Numbers k such that the smallest x > 1 for which Fibonacci(x) == 0 mod k is x = k - 1.

Table of values

n a(n)
1 11
2 19
3 31
4 59
5 71
6 79
7 131
8 179
9 191
10 239
11 251
12 271
13 311
14 359
15 379
16 419
17 431
18 439
19 479
20 491
21 499
22 571
23 599
24 631
25 659
26 719
27 739
28 751
29 839
30 971
31 1019
32 1039
33 1051
34 1091
35 1171
36 1259
37 1319
38 1399
39 1439
40 1451
41 1459
42 1499
43 1531
44 1559
45 1571
46 1619
47 1759
48 1811
49 1831

List of values

[11, 19, 31, 59, 71, 79, 131, 179, 191, 239, 251, 271, 311, 359, 379, 419, 431, 439, 479, 491, 499, 571, 599, 631, 659, 719, 739, 751, 839, 971, 1019, 1039, 1051, 1091, 1171, 1259, 1319, 1399, 1439, 1451, 1459, 1499, 1531, 1559, 1571, 1619, 1759, 1811, 1831]