A070498 a(n) = n^3 mod 36.

0, 1, 8, 27, 28, 17, 0, 19, 8, 9, 28, 35, 0, 1, 8, 27, 28, 17, 0, 19, 8, 9, 28, 35, 0, 1, 8, 27, 28, 17, 0, 19, 8, 9, 28, 35, 0, 1, 8, 27, 28, 17, 0, 19, 8, 9, 28, 35, 0, 1, 8, 27, 28, 17, 0, 19, 8, 9, 28, 35, 0, 1, 8, 27, 28, 17, 0, 19, 8, 9, 28, 35, 0, 1, 8, 27, 28, 17, 0, 19, 8, 9, 28

Offset

0,3

Comments

Equivalently: n^(6*m + 3) mod 36. - 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, -1, 0, 0, 0, 1, 0, 1).

Formula

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

a(6*m) = 0.

a(n) = a(n-12).

G.f.: (-x -8*x^2 -28*x^3 -36*x^4 -44*x^5 -28*x^6 -35*x^7)/(-1 -x^2 +x^6 +x^8). (End)

Mathematica

PowerMod[Range[0, 90], 3, 36] (* Harvey P. Dale, Jun 19 2011 *)

Prog

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

Crossrefs

Sequence in context: A070499 A077107 A335018 * A364875 A358240 A084698

Adjacent sequences: A070495 A070496 A070497 * A070499 A070500 A070501

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved