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.
%I A270491 #13 Mar 21 2016 21:31:23
%S A270491 0,0,0,0,0,0,0,0,0,11138400,2194264800,970377408000,194939999654400,
%T A270491 23386660116019200,63018468582765696000,81934202708323789824000,
%U A270491 118589068612624434080256000,230237098382438262288036864000
%N A270491 a(n) = A256832(n) mod A003266(n).
%e A270491 a(5) = 0 because (1*2*5*12*29) mod (1*1*2*3*5) = 0.
%t A270491 Table[Mod[Product[Expand[((1 + Sqrt@ 2)^j - (1 - Sqrt@ 2)^j)/(2 Sqrt@ 2)], {j, n}], Product[Fibonacci@ k, {k, n}]], {n, 18}] (* _Michael De Vlieger_, Mar 18 2016, after _Vaclav Kotesovec_ at A256832 *)
%o A270491 (PARI) a000129(n) = ([2, 1; 1, 0]^n)[2, 1];
%o A270491 a256832(n) = prod(k=1, n, a000129(k));
%o A270491 a003266(n) = prod(k=1, n, fibonacci(k));
%o A270491 for(n=1, 20, print1(a256832(n) % a003266(n), ", "));
%Y A270491 Cf. A000040, A000129, A003266, A256832.
%K A270491 nonn
%O A270491 1,10
%A A270491 _Altug Alkan_, Mar 18 2016