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.

A204924 Least k such that n divides s(k)-s(j) for some j in [1,k), where s(k)=A000045(k+1) (Fibonacci numbers).

Table of values

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

List of values

[2, 3, 4, 4, 5, 5, 5, 6, 7, 6, 6, 6, 7, 9, 12, 7, 9, 7, 7, 7, 8, 10, 12, 12, 9, 8, 9, 10, 8, 17, 8, 8, 8, 9, 21, 12, 14, 10, 18, 17, 11, 9, 10, 10, 12, 12, 9, 12, 13, 9, 17, 9, 9, 9, 10, 17, 12, 12, 25, 22]