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.
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.
Terms
- a(0) =0a(1) =1a(2) =0a(3) =3a(4) =5a(5) =3a(6) =18a(7) =3a(8) =52a(9) =3a(10) =141a(11) =3a(12) =374a(13) =3a(14) =984a(15) =3a(16) =2581a(17) =3a(18) =6762a(19) =3a(20) =17708a(21) =3a(22) =46365a(23) =3a(24) =121390a(25) =3a(26) =317808a(27) =3a(28) =832037a(29) =3
External references
- oeis: A348591