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.

A162547 Somos-4 variant: if n!=4k+1, then a(n) = (4*a(n-1)*a(n-3) - 4*a(n-2)^2) / a(n-4), otherwise a(n) = 0, with a(-2) = a(-1) = a(0) = 1.

Original entry on oeis.org

1, 0, -4, -16, -64, 0, 4096, 65536, 1048576, 0, -1073741824, -68719476736, -4398046511104, 0, 72057594037927936, 18446744073709551616, 4722366482869645213696, 0, -1237940039285380274899124224, -1267650600228229401496703205376, -1298074214633706907132624082305024, 0
Offset: 0

Views

Author

Paul Barry, Jul 05 2009

Keywords

Comments

Hankel transform of A101499.
Hankel transform of A124431. - Paul Barry, Oct 02 2009

Crossrefs

Programs

  • Mathematica
    a[ n_] := With[{m = n + 1, k = Quotient[n + 2, 4]}, Boole[Mod[m, 4] != 2] (-1)^k 4^(k (m - 2 k))]; (* Michael Somos, Jun 26 2017 *)
  • PARI
    {a(n) = my(m=n+1, k=(n+2)\4); (m%4!=2) * (-1)^k * 4^(k*(m - 2*k))}; /* Michael Somos, Jul 20 2014 */

Formula

a(n) = a(-2 - n), a(n) * a(n+5) = 4 * a(n+1) * a(n+4) for all n in Z. - Michael Somos, Jul 20 2014
a(4*n + 1) = 0 for all n in Z. - Michael Somos, Jun 26 2017