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.

A223486 Lucas entry points: a(n) = least k such that n divides Lucas number L_k (=A000032(k), for k >= 0), or -1 if there is no such k.

Table of values

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

List of values

[0, 0, 2, 3, -1, 6, 4, -1, 6, -1, 5, -1, -1, 12, -1, -1, -1, 6, 9, -1, -1, 15, 12, -1, -1, -1, 18, -1, 7, -1, 15, -1, -1, -1, -1, -1, -1, 9, -1, -1, 10, -1, 22, 15, -1, 12, 8, -1, 28, -1, -1, -1, -1, 18, -1, -1, -1, 21, 29, -1, -1, 15, -1, -1, -1, -1, 34, -1]