login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
0,2
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: A362985 A175131 A033921 * A195711 A200610 A076232
KEYWORD
nonn,easy
AUTHOR
Zerinvary Lajos, Nov 03 2009
STATUS
approved