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!)
 A167425 2^n mod 26. 0
 1, 2, 4, 8, 16, 6, 12, 24, 22, 18, 10, 20, 14, 2, 4, 8, 16, 6, 12, 24, 22, 18, 10, 20, 14, 2, 4, 8, 16, 6, 12, 24, 22, 18, 10, 20, 14, 2, 4, 8, 16, 6, 12, 24, 22, 18, 10, 20, 14, 2, 4, 8, 16, 6, 12, 24, 22, 18, 10, 20, 14, 2, 4, 8, 16, 6, 12, 24, 22, 18, 10, 20, 14, 2, 4, 8, 16, 6, 12, 24 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 LINKS Index entries for linear recurrences with constant coefficients, signature (1, 0, 0, 0, 0, -1, 1). FORMULA a(n)= +a(n-1) -a(n-6) +a(n-7), n>7. G.f.: (x+2*x^2+4*x^3+8*x^4-10*x^5+7*x^6+13*x^7+1)/ ((1-x) * (x^2+1) * (x^4-x^2+1)). - R. J. Mathar, Apr 13 2010 MATHEMATICA PowerMod[2, Range[0, 100], 26] (* or *) PadRight[{1}, 100, {14, 2, 4, 8, 16, 6, 12, 24, 22, 18, 10, 20}] (* Harvey P. Dale, Aug 02 2013 *) PROG (Sage) [power_mod(2, n, 26)for n in range(0, 87)] # (PARI) a(n)=lift(Mod(2, 26)^n) \\ Charles R Greathouse IV, Mar 22 2016 CROSSREFS Sequence in context: A088975 A306601 A237851 * A212638 A016018 A333492 Adjacent sequences:  A167422 A167423 A167424 * A167426 A167427 A167428 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 August 4 02:24 EDT 2021. Contains 346441 sequences. (Running on oeis4.)