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.

A204928 s(k(n)) - s(j(n)), where (s(k(n)), s(j(n))) is the least pair of distinct Fibonacci numbers for which n divides s(k(n)) - s(j(n)).

Table of values

n a(n)
1 1
2 2
3 3
4 4
5 5
6 6
7 7
8 8
9 18
10 10
11 11
12 12
13 13
14 42
15 225
16 16
17 34
18 18
19 19
20 20
21 21
22 88
23 230
24 144
25 50
26 26
27 54
28 84
29 29
30 2550
31 31
32 32
33 33
34 34
35 17710
36 144
37 555
38 76
39 4173
40 2440
41 123
42 42
43 86
44 88
45 225
46 230
47 47
48 144
49 343
50 50
51 2550
52 52
53 53
54 54
55 55
56 2576
57 228
58 232
59 121304

List of values

[1, 2, 3, 4, 5, 6, 7, 8, 18, 10, 11, 12, 13, 42, 225, 16, 34, 18, 19, 20, 21, 88, 230, 144, 50, 26, 54, 84, 29, 2550, 31, 32, 33, 34, 17710, 144, 555, 76, 4173, 2440, 123, 42, 86, 88, 225, 230, 47, 144, 343, 50, 2550, 52, 53, 54, 55, 2576, 228, 232, 121304]