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

A070502
a(n) = n^3 mod 40.
2
0, 1, 8, 27, 24, 5, 16, 23, 32, 9, 0, 11, 8, 37, 24, 15, 16, 33, 32, 19, 0, 21, 8, 7, 24, 25, 16, 3, 32, 29, 0, 31, 8, 17, 24, 35, 16, 13, 32, 39, 0, 1, 8, 27, 24, 5, 16, 23, 32, 9, 0, 11, 8, 37, 24, 15, 16, 33, 32, 19, 0, 21, 8, 7, 24, 25, 16, 3, 32, 29, 0, 31, 8, 17, 24, 35, 16
OFFSET
0,3
COMMENTS
Equivalently: n^(4*m + 3) mod 40. - G. C. Greubel, Mar 31 2016
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, 1).
FORMULA
a(n+40) = a(n). If n even, a(n+20) = a(n). - R. J. Mathar, Sep 25 2008
a(10*m) = 0. - G. C. Greubel, Mar 31 2016
MATHEMATICA
PowerMod[Range[0, 100], 3, 40] (* Harvey P. Dale, Aug 21 2012 *)
PROG
(Sage) [power_mod(n, 3, 40 )for n in range(0, 77)] # Zerinvary Lajos, Oct 30 2009
(Magma) [Modexp(n, 3, 40): n in [0..80]]; // Vincenzo Librandi, Mar 31 2016
(PARI) a(n)=n^3%40 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A070505 A070504 A070503 * A070721 A070501 A070500
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved