A070380 a(n) = 5^n mod 32.

1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9, 13, 1, 5, 25, 29, 17, 21, 9

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 (0,0,0,0,0,0,0,1). [R. J. Mathar, Apr 20 2010]

Formula

From R. J. Mathar, Apr 20 2010: (Start)

a(n) = a(n-8).

G.f.: ( -1-5*x-25*x^2-29*x^3-17*x^4-21*x^5-9*x^6-13*x^7 ) / ( (x-1)*(1+x)*(x^2+1)*(x^4+1) ). (End)

Mathematica

PowerMod[5, Range[0, 50], 32] (* G. C. Greubel, Mar 16 2016 *)

Prog

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

Crossrefs

Sequence in context: A137111 A137110 A036137 * A068574 A000350 A000221

Adjacent sequences: A070377 A070378 A070379 * A070381 A070382 A070383

Keyword

nonn

Author

N. J. A. Sloane, May 12 2002

Status

approved