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.

A205116 Least s(k) such that n divides s(k)-s(j) for some j where s(j)=is the j-th Lucas number.

Table of values

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

List of values

[3, 3, 4, 7, 11, 7, 11, 11, 29, 11, 18, 47, 29, 18, 18, 123, 18, 29, 123, 47, 123, 29, 47, 76, 29, 29, 2207, 29, 47, 123, 2207, 199, 199, 199, 123, 47, 521, 123, 199, 47, 199, 843, 47, 47, 322, 47, 76, 199, 199, 2207, 521, 521, 322, 2207, 322, 123, 3571]