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”).

A167425
a(n) = 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
OFFSET
0,2
FORMULA
From R. J. Mathar, Apr 13 2010: (Start)
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)).
a(n) = +a(n-1) -a(n-6) +a(n-7) for n>7. (End)
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 * A378107 A212638 A016018
KEYWORD
nonn,easy
AUTHOR
Zerinvary Lajos, Nov 03 2009
STATUS
approved