[go: up one dir, main page]

login
A070473
a(n) = n^3 mod 11.
1
0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10, 0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10
OFFSET
0,3
LINKS
Index entries for linear recurrences with constant coefficients, signature (0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-11). - G. C. Greubel, Mar 26 2016
MATHEMATICA
Table[Mod[n^3, 11], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 23 2011 *)
PowerMod[Range[0, 120], 3, 11] (* or *) PadRight[{}, 120, {0, 1, 8, 5, 9, 4, 7, 2, 6, 3, 10}] (* Harvey P. Dale, May 04 2019 *)
PROG
(Sage) [power_mod(n, 3, 11 ) for n in range(0, 99)] # Zerinvary Lajos, Oct 29 2009
(Magma) [n^3 mod 11: n in [0..80] ]; // Vincenzo Librandi, Jun 01 2011
(PARI) a(n)=n^3%11 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved