A070390 a(n) = 5^n mod 44.

1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5, 25, 37, 9, 1, 5

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

Formula

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

a(n) = a(n-5).

G.f.: ( -1-5*x-25*x^2-37*x^3-9*x^4 ) / ( (x-1)*(1+x+x^2+x^3+x^4) ). (End)

Mathematica

PowerMod[5, Range[0, 90], 44] (* or *) LinearRecurrence[{0, 0, 0, 0, 1}, {1, 5, 25, 37, 9}, 90] (* Harvey P. Dale, Apr 21 2011 *)

Prog

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

Crossrefs

Sequence in context: A343734 A279541 A361615 * A018724 A070389 A098993

Adjacent sequences: A070387 A070388 A070389 * A070391 A070392 A070393

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved