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.

A205114 Least k such that n divides L(k)-L(j) for some j satisfying 1<=j where L(j) is the j-th Lucas number (A000032).

Table of values

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

List of values

[2, 2, 3, 4, 5, 4, 5, 5, 7, 5, 6, 8, 7, 6, 6, 10, 6, 7, 10, 8, 10, 7, 8, 9, 7, 7, 16, 7, 8, 10, 16, 11, 11, 11, 10, 8, 13, 10, 11, 8, 11, 14, 8, 8, 12, 8, 9, 11, 11, 16, 13, 13, 12, 16, 12, 10, 17, 9, 14, 10]