A070533 a(n) = n^4 mod 15.

0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6, 1, 1, 6, 10, 1, 6, 1, 1, 0, 1, 1, 6, 1, 10, 6

Offset

0,4

Comments

Equivalently: n^(4*m+4) mod 15. - 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, 1).

Formula

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

a(15*n) = 0.

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

Mathematica

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

Prog

(Sage) [power_mod(n, 4, 15)for n in range(0, 97)] # Zerinvary Lajos, Oct 31 2009
(PARI) a(n)=n^4%15 \\ Charles R Greathouse IV, Apr 06 2016

Crossrefs

Sequence in context: A329047 A363316 A347130 * A336475 A082744 A127142

Adjacent sequences: A070530 A070531 A070532 * A070534 A070535 A070536

Keyword

nonn,easy

Author

N. J. A. Sloane, May 13 2002

Status

approved