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

A070482
a(n) = n^3 mod 20.
2
0, 1, 8, 7, 4, 5, 16, 3, 12, 9, 0, 11, 8, 17, 4, 15, 16, 13, 12, 19, 0, 1, 8, 7, 4, 5, 16, 3, 12, 9, 0, 11, 8, 17, 4, 15, 16, 13, 12, 19, 0, 1, 8, 7, 4, 5, 16, 3, 12, 9, 0, 11, 8, 17, 4, 15, 16, 13, 12, 19, 0, 1, 8, 7, 4, 5, 16, 3, 12, 9, 0, 11, 8, 17, 4, 15, 16, 13, 12, 19, 0, 1, 8, 7, 4, 5
OFFSET
0,3
COMMENTS
Equivalently, n^7 mod 20. - Ray Chandler, Dec 27 2023
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, 1).
FORMULA
From G. C. Greubel, Mar 28 2016: (Start)
a(n) = a(n-20).
G.f.: (-x -8*x^2 -7*x^3 -4*x^4 -5*x^5 -16*x^6 -3*x^7 -12*x^8 -9*x^9 -11*x^11 -8*x^12 -17*x^13 -4*x^14 -15*x^15 -16*x^16 -13*x^17 -12*x^18 -19*x^19)/(-1 + x^20). (End)
MATHEMATICA
PowerMod[Range[0, 90], 3, 20] (* G. C. Greubel, Mar 28 2016 *)
PROG
(Sage) [power_mod(n, 3, 20 )for n in range(0, 86)] # Zerinvary Lajos, Oct 29 2009
(PARI) a(n)=n^3%20 \\ Charles R Greathouse IV, Apr 06 2016
(Magma) [Modexp(n, 3, 20): n in [0..80]]; // Vincenzo Librandi, Jun 17 2016
CROSSREFS
Sequence in context: A077744 A111448 A169885 * A070702 A019870 A019903
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved