

A070411


a(n) = 7^n mod 26.


1



1, 7, 23, 5, 9, 11, 25, 19, 3, 21, 17, 15, 1, 7, 23, 5, 9, 11, 25, 19, 3, 21, 17, 15, 1, 7, 23, 5, 9, 11, 25, 19, 3, 21, 17, 15, 1, 7, 23, 5, 9, 11, 25, 19, 3, 21, 17, 15, 1, 7, 23, 5, 9, 11, 25, 19, 3, 21, 17, 15, 1, 7, 23, 5, 9, 11, 25, 19, 3, 21, 17, 15, 1, 7, 23, 5, 9, 11, 25, 19, 3
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,2


LINKS

G. C. Greubel, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,1,1).  R. J. Mathar, Apr 20 2010


FORMULA

From R. J. Mathar, Apr 20 2010: (Start)
a(n) = a(n1)  a(n6) + a(n7).
G..f: ( 16*x16*x^2+18*x^34*x^42*x^515*x^6 ) / ( (x1)*(x^2+1)*(x^4x^2+1) ). (End)
a(n) = a(n12).  G. C. Greubel, Mar 20 2016


MATHEMATICA

PowerMod[7, Range[0, 80], 26] (* or *) LinearRecurrence[{1, 0, 0, 0, 0, 1, 1}, {1, 7, 23, 5, 9, 11, 25}, 81] (* Harvey P. Dale, Dec 26 2011 *)


PROG

(Sage) [power_mod(7, n, 26)for n in xrange(0, 81)] # Zerinvary Lajos, Nov 27 2009
(PARI) a(n) = lift(Mod(7, 26)^n); \\ Altug Alkan, Mar 20 2016
(MAGMA) [Modexp(7, n, 26): n in [0..100]]; // Bruno Berselli, Mar 22 2016


CROSSREFS

Sequence in context: A087184 A067959 A273216 * A167224 A175483 A121815
Adjacent sequences: A070408 A070409 A070410 * A070412 A070413 A070414


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, May 12 2002


STATUS

approved



