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.

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.

Terms

    a(0) =0a(1) =1a(2) =2a(3) =6a(4) =15a(5) =11a(6) =10a(7) =45a(8) =99a(9) =79a(10) =65a(11) =312a(12) =675a(13) =545a(14) =442a(15) =2142a(16) =4623a(17) =3739a(18) =3026a(19) =14685a(20) =31683a(21) =25631a(22) =20737a(23) =100656a(24) =217155a(25) =175681a(26) =142130a(27) =689910a(28) =1488399a(29) =1204139

External references