A070391 a(n) = 5^n mod 46.

1, 5, 25, 33, 27, 43, 31, 17, 39, 11, 9, 45, 41, 21, 13, 19, 3, 15, 29, 7, 35, 37, 1, 5, 25, 33, 27, 43, 31, 17, 39, 11, 9, 45, 41, 21, 13, 19, 3, 15, 29, 7, 35, 37, 1, 5, 25, 33, 27, 43, 31, 17, 39, 11, 9, 45, 41, 21, 13, 19, 3, 15, 29, 7, 35, 37, 1, 5, 25, 33, 27, 43, 31, 17, 39

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

Formula

a(n) = 2*a(n-1) -2*a(n-2) +2*a(n-3) -2*a(n-4) +2*a(n-5) -2*a(n-6) +2*a(n-7) -2*a(n-8) +2*a(n-9) -2*a(n-10) +a(n-11). - R. J. Mathar, Apr 20 2010

a(n) = a(n-22). - G. C. Greubel, Mar 18 2016

Prog

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

Crossrefs

Sequence in context: A018639 A029475 A332657 * A084967 A249827 A343734

Adjacent sequences: A070388 A070389 A070390 * A070392 A070393 A070394

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved