A070489 a(n) = n^3 mod 27.

0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10, 17, 0, 19, 26, 0, 1, 8, 0, 10

Offset

0,3

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, 1).

Formula

a(3*k) = 0. - Altug Alkan, Oct 03 2015

a(n) = a(n+9). - Altug Alkan, Oct 03 2015

G.f.: (-x -8*x^2 -10*x^4 -17*x^5 -19*x^7 -26*x^8)/(-1 + x^9). - G. C. Greubel, Mar 30 2016

Mathematica

Table[PowerMod[n, 3, 27], {n, 0, 100}] (* Vincenzo Librandi, Oct 03 2015 *)

Prog

(Sage) [power_mod(n, 3, 27 ) for n in range(0, 86)] # Zerinvary Lajos, Oct 30 2009
(PARI) vector(100, n, (n-1)^3 % 27); \\ Altug Alkan, Oct 03 2015

Crossrefs

Cf. A000578, A070490.

Sequence in context: A320378 A228412 A260947 * A112268 A077062 A189764

Adjacent sequences: A070486 A070487 A070488 * A070490 A070491 A070492

Keyword

nonn,easy

Author

N. J. A. Sloane, May 12 2002

Status

approved