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”).

A070503
a(n) = n^3 mod 41.
1
0, 1, 8, 27, 23, 2, 11, 15, 20, 32, 16, 19, 6, 24, 38, 13, 37, 34, 10, 12, 5, 36, 29, 31, 7, 4, 28, 3, 17, 35, 22, 25, 9, 21, 26, 30, 39, 18, 14, 33, 40, 0, 1, 8, 27, 23, 2, 11, 15, 20, 32, 16, 19, 6, 24, 38, 13, 37, 34, 10, 12, 5, 36, 29, 31, 7, 4, 28, 3, 17, 35, 22, 25, 9, 21, 26
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, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-41). - G. C. Greubel, Mar 31 2016
MATHEMATICA
Table[Mod[n^3, 41], {n, 0, 100}] (* Vincenzo Librandi, Jun 19 2014 *)
PowerMod[Range[0, 100], 3, 41] (* Harvey P. Dale, Nov 11 2022 *)
PROG
(Sage) [power_mod(n, 3, 41) for n in range(0, 76)] # Zerinvary Lajos, Oct 30 2009
(Magma) [Modexp(n, 3, 41): n in [0..80]]; // Vincenzo Librandi, Mar 31 2016
(PARI) a(n)=n^3%41 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Cf. A008960.
Sequence in context: A070506 A070505 A070504 * A070502 A070721 A070501
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved