login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A070499
a(n) = n^3 mod 37.
1
0, 1, 8, 27, 27, 14, 31, 10, 31, 26, 1, 36, 26, 14, 6, 8, 26, 29, 23, 14, 8, 11, 29, 31, 23, 11, 1, 36, 11, 6, 27, 6, 23, 10, 10, 29, 36, 0, 1, 8, 27, 27, 14, 31, 10, 31, 26, 1, 36, 26, 14, 6, 8, 26, 29, 23, 14, 8, 11, 29, 31, 23, 11, 1, 36, 11, 6, 27, 6, 23, 10, 10, 29, 36, 0, 1
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, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-37). - G. C. Greubel, Mar 30 2016
MATHEMATICA
PowerMod[Range[0, 80], 3, 37] (* Harvey P. Dale, May 21 2014 *)
Table[Mod[n^3, 37], {n, 0, 100}] (* Vincenzo Librandi, Jun 19 2014 *)
PROG
(Sage) [power_mod(n, 3, 37 )for n in range(0, 76)] # Zerinvary Lajos, Oct 30 2009
(Magma) [n^3 mod 37: n in [0..80]]; // Vincenzo Librandi, Jun 19 2014
(PARI) a(n)=n^3%37 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Cf. A008960.
Sequence in context: A070501 A070500 A100499 * A077107 A335018 A070498
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved