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.

A023182 Numbers k such that Fibonacci(k) == 89 (mod k).

Table of values

n a(n)
1 1
2 2
3 3
4 11
5 21
6 22
7 92
8 121
9 133
10 209
11 319
12 341
13 451
14 493
15 649
16 671
17 781
18 869
19 979
20 1111
21 1131
22 1199
23 1419
24 1441
25 1529
26 1639
27 1661
28 1969
29 1991
30 2101
31 2189
32 2321
33 2519
34 2629
35 2651
36 2761
37 2773
38 2959
39 2981
40 3091
41 3421
42 3641
43 3839
44 3949
45 4169
46 4279
47 4411
48 4499

List of values

[1, 2, 3, 11, 21, 22, 92, 121, 133, 209, 319, 341, 451, 493, 649, 671, 781, 869, 979, 1111, 1131, 1199, 1419, 1441, 1529, 1639, 1661, 1969, 1991, 2101, 2189, 2321, 2519, 2629, 2651, 2761, 2773, 2959, 2981, 3091, 3421, 3641, 3839, 3949, 4169, 4279, 4411, 4499]