A070597 Duplicate of A070474.

0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 3, 4, 5, 0, 7, 8, 9, 4, 11, 0, 1, 8, 3

Offset

0,3

Comments

a(n)=A070474(n) [Proof: n^5-n^3 == 0 (mod 12) is shown explicitly for n=0 to 11, then the induction n->n+12 for the 5th-order polynomial followed by binomial expansion of (n+12)^k concludes that the zero (mod 12) is periodically extended to the other integers.] - R. J. Mathar, Jul 23 2009

Links

Table of n, a(n) for n=0..99.

Mathematica

Table[Mod[n^5, 12], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2011 *)

Prog

(Sage) [power_mod(n, 7, 12) for n in range(0, 100)] # Zerinvary Lajos, Oct 28 2009

Crossrefs

Cf. A008960, A070474.

Sequence in context: A338462 A201754 A070474 * A222232 A091895 A111436

Adjacent sequences: A070594 A070595 A070596 * A070598 A070599 A070600

Keyword

dead

Author

N. J. A. Sloane, May 13 2002

Status

approved