A070515 a(n) = n^4 mod 11.

0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1, 5, 4, 3, 9, 9, 3, 4, 5, 1, 0, 1

Offset

0,3

Comments

Equivalently: n^(10*m + 4) mod 11. - G. C. Greubel, Apr 01 2016

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

Formula

From G. C. Greubel, Apr 01 2016: (Start)

a(n) = a(n-11).

a(11*m) = 0.

G.f.: (x +5*x^2 +4*x^3 +3*x^4 +9*x^5 +9*x^6 +3*x^7 +4*x^8 +5*x^9 +x^10)/(1 - x^11). (End)

Mathematica

PowerMod[Range[0, 100], 4, 11] (* Harvey P. Dale, Oct 20 2013 *)

Prog

(Sage) [power_mod(n, 4, 11)for n in range(0, 101)] # Zerinvary Lajos, Oct 31 2009
(Magma) [Modexp(n, 4, 11): n in [0..100]]; // Vincenzo Librandi, Apr 02 2016
(PARI) a(n)=n^4%11 \\ Charles R Greathouse IV, Apr 06 2016

Crossrefs

Sequence in context: A194556 A154198 A086793 * A096733 A125900 A019102

Adjacent sequences: A070512 A070513 A070514 * A070516 A070517 A070518

Keyword

nonn,easy

Author

N. J. A. Sloane, May 13 2002

Status

approved