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.

A078345 Numbers k such that F(k) mod k divides F(F(k) mod k) where F(k) denotes the k-th Fibonacci number.

Table of values

n a(n)
1 1
2 2
3 5
4 8
5 10
6 11
7 12
8 13
9 19
10 20
11 21
12 22
13 24
14 25
15 26
16 29
17 31
18 32
19 36
20 37
21 38
22 41
23 44
24 48
25 49
26 50
27 55
28 58
29 59
30 60
31 61
32 62
33 65
34 71
35 72
36 73
37 79
38 80
39 82
40 84
41 89
42 95
43 96
44 97
45 101
46 104
47 108
48 109
49 118
50 120
51 122
52 125
53 131
54 132
55 139
56 140
57 142
58 144
59 145
60 149
61 151
62 155
63 156

List of values

[1, 2, 5, 8, 10, 11, 12, 13, 19, 20, 21, 22, 24, 25, 26, 29, 31, 32, 36, 37, 38, 41, 44, 48, 49, 50, 55, 58, 59, 60, 61, 62, 65, 71, 72, 73, 79, 80, 82, 84, 89, 95, 96, 97, 101, 104, 108, 109, 118, 120, 122, 125, 131, 132, 139, 140, 142, 144, 145, 149, 151, 155, 156]