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.

A248593 Least positive integer m such that m + n divides F(m), where F(m) is the m-th Fibonacci number given by A000045.

Table of values

n a(n)
1 10
2 6
3 84
4 12
5 16
6 7
7 27
8 9
9 144
10 30
11 28
12 12
13 8
14 30
15 14
16 18
17 57
18 19
19 342
20 18
21 20
22 24
23 66
24 12
25 9
26 27
27 144
28 60
29 112
30 35
31 16
32 24
33 60
34 55
35 20
36 12
37 40
38 111
39 24
40 36
41 88
42 72
43 80
44 48
45 10
46 15
47 72
48 24
49 224
50 18
51 50
52 54
53 270
54 72
55 54
56 33
57 224
58 18
59 28
60 12

List of values

[10, 6, 84, 12, 16, 7, 27, 9, 144, 30, 28, 12, 8, 30, 14, 18, 57, 19, 342, 18, 20, 24, 66, 12, 9, 27, 144, 60, 112, 35, 16, 24, 60, 55, 20, 12, 40, 111, 24, 36, 88, 72, 80, 48, 10, 15, 72, 24, 224, 18, 50, 54, 270, 72, 54, 33, 224, 18, 28, 12]