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.

A167420 2^n mod 14.

Original entry on oeis.org

1, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8, 2, 4, 8
Offset: 0

Views

Author

Zerinvary Lajos, Nov 03 2009

Keywords

Programs

  • Mathematica
    PowerMod[2,Range[0,100],14] (* Harvey P. Dale, Jul 25 2011 *)
  • PARI
    a(n)=lift(Mod(2,14)^n) \\ Charles R Greathouse IV, Mar 22 2016
  • Sage
    [power_mod(2,n,14)for n in range(0,100)] #
    

Formula

G.f.: 1 + -2*x*(1+2*x+4*x^2) / ( (x-1)*(1+x+x^2) ). - R. J. Mathar, Jun 18 2019