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.

A270491 a(n) = A256832(n) mod A003266(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 11138400, 2194264800, 970377408000, 194939999654400, 23386660116019200, 63018468582765696000, 81934202708323789824000, 118589068612624434080256000, 230237098382438262288036864000
Offset: 1

Views

Author

Altug Alkan, Mar 18 2016

Keywords

Examples

			a(5) = 0 because (1*2*5*12*29) mod (1*1*2*3*5) = 0.
		

Crossrefs

Programs

  • Mathematica
    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 *)
  • PARI
    a000129(n) = ([2, 1; 1, 0]^n)[2, 1];
    a256832(n) = prod(k=1, n, a000129(k));
    a003266(n) = prod(k=1, n, fibonacci(k));
    for(n=1, 20, print1(a256832(n) % a003266(n), ", "));