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.

A338736 a(n) = L(L(n)) mod n, where L = Lucas numbers = A000032.

Table of values

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

List of values

[0, 0, 1, 1, 4, 0, 3, 7, 7, 4, 10, 3, 9, 10, 7, 15, 12, 0, 10, 9, 7, 4, 22, 3, 1, 4, 7, 1, 4, 18, 30, 31, 7, 4, 29, 15, 1, 34, 34, 39, 35, 24, 29, 29, 7, 4, 46, 3, 1, 4, 7, 29, 29, 0, 21, 55, 7, 54, 35, 3, 45, 4, 7, 63, 64, 36, 2, 29, 7, 4, 6, 3, 43, 4, 7, 29]