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.

A205117 The number s(j) such that n divides s(k)-s(j), where s(j) is the j-th Lucas number and k is the least positive integer for which such a j with 0 exists.

Table of values

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

List of values

[1, 1, 1, 3, 1, 1, 4, 3, 11, 1, 7, 11, 3, 4, 3, 11, 1, 11, 47, 7, 18, 7, 1, 4, 4, 3, 47, 1, 18, 3, 843, 7, 1, 29, 18, 11, 3, 47, 4, 7, 76, 3, 4, 3, 7, 1, 29, 7, 3, 7, 11, 1, 4, 47, 47, 11, 322, 18, 76, 3]