A070478 a(n) = n^3 mod 16.

0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15, 0, 1, 8, 11, 0, 13, 8, 7, 0, 9, 8, 3, 0, 5, 8, 15

Offset

0,3

Comments

a(4k) = 0, k>=0, k being integer. - G. C. Greubel, Mar 30 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, 1).

Formula

From G. C. Greubel, Mar 28 2016: (Start)

a(n) = a(n-16).

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

Mathematica

Table[Mod[n^3, 16], {n, 0, 100}] (* G. C. Greubel, Mar 28 2016 *)

Prog

(SageMath) [power_mod(n, 3, 16) for n in range(0, 96)] # Zerinvary Lajos, Oct 28 2009
(Magma) [Modexp(n, 3, 16): n in [0..100]]; // Vincenzo Librandi, Mar 28 2016
(PARI) a(n)=n^3%16 \\ Charles R Greathouse IV, Apr 06 2016

Crossrefs

Sequence in context: A002286 A256877 A222299 * A306527 A396617 A347306

Adjacent sequences: A070475 A070476 A070477 * A070479 A070480 A070481

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved