The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A167420 2^n mod 14. 0
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Index entries for linear recurrences with constant coefficients, signature (0,0,1). FORMULA G.f.: 1 + -2*x*(1+2*x+4*x^2) / ( (x-1)*(1+x+x^2) ). - R. J. Mathar, Jun 18 2019 MATHEMATICA PowerMod[2, Range[0, 100], 14] (* Harvey P. Dale, Jul 25 2011 *) PROG (Sage) [power_mod(2, n, 14)for n in range(0, 100)] # (PARI) a(n)=lift(Mod(2, 14)^n) \\ Charles R Greathouse IV, Mar 22 2016 CROSSREFS Sequence in context: A215452 A175131 A033921 * A195711 A200610 A076232 Adjacent sequences:  A167417 A167418 A167419 * A167421 A167422 A167423 KEYWORD nonn,easy AUTHOR Zerinvary Lajos, Nov 03 2009 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified April 12 15:00 EDT 2021. Contains 342921 sequences. (Running on oeis4.)