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.

A348592 a(n) = F(n)*F(n+1) mod L(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 2
3 6
4 15
5 11
6 10
7 45
8 99
9 79
10 65
11 312
12 675
13 545
14 442
15 2142
16 4623
17 3739
18 3026
19 14685
20 31683
21 25631
22 20737
23 100656
24 217155
25 175681
26 142130
27 689910
28 1488399
29 1204139
30 974170
31 4728717
32 10201635
33 8253295
34 6677057
35 32411112
36 69923043
37 56568929
38 45765226
39 222149070
40 479259663
41 387729211
42 313679522

List of values

[0, 1, 2, 6, 15, 11, 10, 45, 99, 79, 65, 312, 675, 545, 442, 2142, 4623, 3739, 3026, 14685, 31683, 25631, 20737, 100656, 217155, 175681, 142130, 689910, 1488399, 1204139, 974170, 4728717, 10201635, 8253295, 6677057, 32411112, 69923043, 56568929, 45765226, 222149070, 479259663, 387729211, 313679522]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.