login
A070493
a(n) = n^3 mod 31.
1
0, 1, 8, 27, 2, 1, 30, 2, 16, 16, 8, 29, 23, 27, 16, 27, 4, 15, 4, 8, 2, 23, 15, 15, 29, 1, 30, 29, 4, 23, 30, 0, 1, 8, 27, 2, 1, 30, 2, 16, 16, 8, 29, 23, 27, 16, 27, 4, 15, 4, 8, 2, 23, 15, 15, 29, 1, 30, 29, 4, 23, 30, 0, 1, 8, 27, 2, 1, 30, 2, 16, 16, 8, 29, 23, 27, 16, 27, 4, 15, 4
OFFSET
0,3
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-31). - G. C. Greubel, Mar 30 2016
MATHEMATICA
Table[Mod[n^3, 31], {n, 0, 100}] (* Vincenzo Librandi, Jun 19 2014 *)
PowerMod[Range[0, 100], 3, 31] (* Harvey P. Dale, Apr 13 2015 *)
PROG
(Sage) [power_mod(n, 3, 31 )for n in range(0, 81)] # Zerinvary Lajos, Oct 30 2009
(Magma) [n^3 mod 31: n in [0..80]]; // Vincenzo Librandi, Jun 19 2014
(PARI) a(n)=n^3%31 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Cf. A008960.
Sequence in context: A070494 A334659 A350625 * A257853 A070492 A070711
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved