A070541 - OEIS

A070541

a(n) = n^4 mod 22.

0, 1, 16, 15, 14, 9, 20, 3, 4, 5, 12, 11, 12, 5, 4, 3, 20, 9, 14, 15, 16, 1, 0, 1, 16, 15, 14, 9, 20, 3, 4, 5, 12, 11, 12, 5, 4, 3, 20, 9, 14, 15, 16, 1, 0, 1, 16, 15, 14, 9, 20, 3, 4, 5, 12, 11, 12, 5, 4, 3, 20, 9, 14, 15, 16, 1, 0, 1, 16, 15, 14, 9, 20, 3, 4, 5, 12, 11, 12, 5, 4, 3, 20, 9

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

COMMENTS

Equivalently: n^(10*m + 4) mod 22. - G. C. Greubel, Apr 05 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).

FORMULA

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

a(21*n) = 0.

a(n+21) = a(n). (End)

MATHEMATICA

PowerMod[Range[0, 100], 4, 22] (* G. C. Greubel, Apr 05 2016 *)

PadRight[{}, 120, {0, 1, 16, 15, 14, 9, 20, 3, 4, 5, 12, 11, 12, 5, 4, 3, 20, 9, 14, 15, 16, 1}] (* Harvey P. Dale, Feb 25 2017 *)

PROG

(Sage) [power_mod(n, 4, 22)for n in range(0, 84)] # Zerinvary Lajos, Oct 31 2009

(Magma) [Modexp(n, 4, 22): n in [0..100]]; // Vincenzo Librandi, Apr 06 2016

(PARI) a(n)=n^4%22 \\ Charles R Greathouse IV, Apr 06 2016

CROSSREFS

Sequence in context: A159454 A334350 A306305 * A022972 A023458 A284498

Adjacent sequences: A070538 A070539 A070540 * A070542 A070543 A070544

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane, May 13 2002

STATUS

approved