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.

A023163 Numbers k such that Fibonacci(k) == -2 (mod k).

Table of values

n a(n)
1 1
2 9
3 39
4 111
5 129
6 159
7 201
8 249
9 321
10 471
11 489
12 519
13 591
14 681
15 831
16 849
17 879
18 921
19 951
20 1041
21 1119
22 1191
23 1329
24 1401
25 1569
26 1641
27 1671
28 1689
29 1761
30 1839
31 1929
32 1959
33 2031
34 2049
35 2199
36 2271
37 2319
38 2361
39 2391
40 2481
41 2559
42 2631
43 2649
44 2721
45 2841
46 2991
47 3039

List of values

[1, 9, 39, 111, 129, 159, 201, 249, 321, 471, 489, 519, 591, 681, 831, 849, 879, 921, 951, 1041, 1119, 1191, 1329, 1401, 1569, 1641, 1671, 1689, 1761, 1839, 1929, 1959, 2031, 2049, 2199, 2271, 2319, 2361, 2391, 2481, 2559, 2631, 2649, 2721, 2841, 2991, 3039]