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.

A023174 Numbers k such that Fibonacci(k) == 2 (mod k).

Table of values

n a(n)
1 1
2 3
3 6
4 77
5 93
6 123
7 143
8 213
9 237
10 267
11 453
12 483
13 573
14 597
15 627
16 717
17 723
18 813
19 843
20 933
21 1077
22 1203
23 1227
24 1293
25 1317
26 1347
27 1437
28 1517
29 1563
30 1707
31 1763
32 1797
33 1803
34 1893
35 1923
36 2157
37 2253
38 2283
39 2307
40 2427
41 2517
42 2643
43 2691
44 2733
45 2757
46 2787
47 2973
48 3021

List of values

[1, 3, 6, 77, 93, 123, 143, 213, 237, 267, 453, 483, 573, 597, 627, 717, 723, 813, 843, 933, 1077, 1203, 1227, 1293, 1317, 1347, 1437, 1517, 1563, 1707, 1763, 1797, 1803, 1893, 1923, 2157, 2253, 2283, 2307, 2427, 2517, 2643, 2691, 2733, 2757, 2787, 2973, 3021]