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.

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

Table of values

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

List of values

[1, 0, 1, 3, 1, 1, 0, 1, 1, 7, 4, 1, 199, 1, 4, 843, 1, 1, 0, 1, 29, 123, 4, 1, 3, 199, 4, 39603, 29, 1, 5778, 1, 1, 7, 4, 17622890, 12752043, 1, 4, 39603, 7881196, 1, 5778, 1, 29, 7, 4, 1, 3, 1149851, 28143689044, 7, 29, 1, 0, 312119004790, 6643838879, 7, 4, 1]