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.

A194363 Lucas entry points: smallest m >= 0 such that the n-th prime divides Lucas(m), or -1 if there is no such m.

Table of values

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

List of values

[0, 2, -1, 4, 5, -1, -1, 9, 12, 7, 15, -1, 10, 22, 8, -1, 29, -1, 34, 35, -1, 39, 42, -1, -1, 25, 52, 18, -1, -1, 64, 65, -1, 23, -1, 25, -1, 82, 84, -1, 89, 45, 95, -1, -1, 11, 21, 112, 114, 57, -1, 119, 60, 125, -1, 44, -1, 135, -1, 14, 142, -1, 22, 155, -1]