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.

A023176 Numbers k such that Fibonacci(k) == 5 (mod k).

Table of values

n a(n)
1 1
2 2
3 3
4 5
5 8
6 10
7 20
8 21
9 32
10 55
11 80
12 95
13 104
14 145
15 155
16 165
17 205
18 247
19 295
20 305
21 320
22 355
23 395
24 437
25 445
26 505
27 545
28 605
29 655
30 667
31 695
32 745
33 755
34 895
35 905
36 955
37 987
38 995
39 1055
40 1145
41 1195
42 1205
43 1255
44 1345
45 1355
46 1405
47 1435
48 1555
49 1615
50 1655
51 1705
52 1745
53 1795

List of values

[1, 2, 3, 5, 8, 10, 20, 21, 32, 55, 80, 95, 104, 145, 155, 165, 205, 247, 295, 305, 320, 355, 395, 437, 445, 505, 545, 605, 655, 667, 695, 745, 755, 895, 905, 955, 987, 995, 1055, 1145, 1195, 1205, 1255, 1345, 1355, 1405, 1435, 1555, 1615, 1655, 1705, 1745, 1795]