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.

A023173 Numbers k such that Fibonacci(k) == 1 (mod k).

Table of values

n a(n)
1 1
2 2
3 11
4 19
5 22
6 29
7 31
8 38
9 41
10 58
11 59
12 61
13 62
14 71
15 79
16 82
17 89
18 101
19 109
20 118
21 122
22 131
23 139
24 142
25 149
26 151
27 158
28 178
29 179
30 181
31 191
32 199
33 202
34 211
35 218
36 229
37 239
38 241
39 251
40 262
41 269
42 271
43 278
44 281
45 298
46 302
47 311
48 323
49 331
50 349
51 358
52 359
53 362
54 379
55 382
56 389
57 398
58 401

List of values

[1, 2, 11, 19, 22, 29, 31, 38, 41, 58, 59, 61, 62, 71, 79, 82, 89, 101, 109, 118, 122, 131, 139, 142, 149, 151, 158, 178, 179, 181, 191, 199, 202, 211, 218, 229, 239, 241, 251, 262, 269, 271, 278, 281, 298, 302, 311, 323, 331, 349, 358, 359, 362, 379, 382, 389, 398, 401]