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.

A348591 a(n) = L(n)*L(n+1) mod F(n+2) where F=A000045 is the Fibonacci numbers and L = A000032 is the Lucas numbers.

Table of values

n a(n)
0 0
1 1
2 0
3 3
4 5
5 3
6 18
7 3
8 52
9 3
10 141
11 3
12 374
13 3
14 984
15 3
16 2581
17 3
18 6762
19 3
20 17708
21 3
22 46365
23 3
24 121390
25 3
26 317808
27 3
28 832037
29 3
30 2178306
31 3
32 5702884
33 3
34 14930349
35 3
36 39088166
37 3
38 102334152
39 3
40 267914293
41 3
42 701408730
43 3
44 1836311900
45 3
46 4807526973
47 3
48 12586269022
49 3
50 32951280096
51 3
52 86267571269
53 3

List of values

[0, 1, 0, 3, 5, 3, 18, 3, 52, 3, 141, 3, 374, 3, 984, 3, 2581, 3, 6762, 3, 17708, 3, 46365, 3, 121390, 3, 317808, 3, 832037, 3, 2178306, 3, 5702884, 3, 14930349, 3, 39088166, 3, 102334152, 3, 267914293, 3, 701408730, 3, 1836311900, 3, 4807526973, 3, 12586269022, 3, 32951280096, 3, 86267571269, 3]