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.

A023162 Numbers k such that F(k) == -1 (mod k), where F(n) = A000045(n) is the n-th Fibonacci number.

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 7
6 13
7 14
8 17
9 23
10 26
11 34
12 37
13 43
14 46
15 47
16 53
17 67
18 73
19 74
20 83
21 86
22 94
23 97
24 103
25 106
26 107
27 113
28 127
29 134
30 137
31 146
32 157
33 163
34 166
35 167
36 173
37 193
38 194
39 197
40 206
41 214
42 223
43 226
44 227
45 233
46 254
47 257
48 263
49 274
50 277
51 283
52 293
53 307
54 313
55 314
56 317
57 326
58 334

List of values

[1, 2, 3, 4, 7, 13, 14, 17, 23, 26, 34, 37, 43, 46, 47, 53, 67, 73, 74, 83, 86, 94, 97, 103, 106, 107, 113, 127, 134, 137, 146, 157, 163, 166, 167, 173, 193, 194, 197, 206, 214, 223, 226, 227, 233, 254, 257, 263, 274, 277, 283, 293, 307, 313, 314, 317, 326, 334]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.