A070416 a(n) = 7^n mod 32.

1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23, 1, 7, 17, 23

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,1).

Formula

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

a(n) = a(n-4).

G.f.: ( -1 - 7*x - 17*x^2 - 23*x^3 ) / ( (x-1)*(1+x)*(1+x^2) ). (End)

E.g.f.: 9*cosh(x) + 15*sinh(x) - 8*cos(x) - 8*sin(x). - G. C. Greubel, Mar 20 2016

Mathematica

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

Prog

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

Crossrefs

Sequence in context: A327830 A144695 A125244 * A087168 A247560 A215824

Adjacent sequences: A070413 A070414 A070415 * A070417 A070418 A070419

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved