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.

A205113 Least k such that n divides the k-th difference between distinct Lucas numbers.

Table of values

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

List of values

[1, 1, 2, 5, 7, 4, 9, 8, 20, 7, 14, 26, 17, 13, 12, 41, 11, 20, 44, 25, 42, 19, 22, 31, 18, 17, 113, 16, 27, 38, 119, 49, 46, 52, 42, 26, 68, 44, 48, 25, 54, 80, 24, 23, 59, 22, 35, 49, 47, 109, 71, 67, 58, 113, 63, 41, 132, 34, 87, 38]