

A070382


a(n) = 5^n mod 34.


1



1, 5, 25, 23, 13, 31, 19, 27, 33, 29, 9, 11, 21, 3, 15, 7, 1, 5, 25, 23, 13, 31, 19, 27, 33, 29, 9, 11, 21, 3, 15, 7, 1, 5, 25, 23, 13, 31, 19, 27, 33, 29, 9, 11, 21, 3, 15, 7, 1, 5, 25, 23, 13, 31, 19, 27, 33, 29, 9, 11, 21, 3, 15, 7, 1, 5, 25, 23, 13, 31, 19, 27, 33, 29, 9, 11
(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,0,0,1,1). [R. J. Mathar, Apr 20 2010]


FORMULA

From R. J. Mathar, Apr 20 2010: (Start)
a(n) = a(n1)  a(n8) + a(n9).
G.f.: ( 14*x20*x^2+2*x^3+10*x^418*x^5+12*x^68*x^77*x^8 ) / ( (x1)*(1+x^8) ). (End)
a(n) = a(n16).  G. C. Greubel, Mar 16 2016


MATHEMATICA

Mod[5^Range[0, 100], 34] (* Harvey P. Dale, Mar 01 2011 *)


PROG

(Sage) [power_mod(5, n, 34) for n in xrange(0, 76)] # Zerinvary Lajos, Nov 26 2009
(PARI) a(n) = lift(Mod(5, 34)^n); \\ Altug Alkan, Mar 16 2016


CROSSREFS

Sequence in context: A070061 A070376 A036139 * A271379 A192493 A265973
Adjacent sequences: A070379 A070380 A070381 * A070383 A070384 A070385


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, May 12 2002


STATUS

approved



