login
A070495
a(n) = n^3 mod 33.
2
0, 1, 8, 27, 31, 26, 18, 13, 17, 3, 10, 11, 12, 19, 5, 9, 4, 29, 24, 28, 14, 21, 22, 23, 30, 16, 20, 15, 7, 2, 6, 25, 32, 0, 1, 8, 27, 31, 26, 18, 13, 17, 3, 10, 11, 12, 19, 5, 9, 4, 29, 24, 28, 14, 21, 22, 23, 30, 16, 20, 15, 7, 2, 6, 25, 32, 0, 1, 8, 27, 31, 26, 18, 13, 17, 3
OFFSET
0,3
COMMENTS
Equivalently: n^(10*m + 3) mod 33. - G. C. Greubel, Mar 30 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, 1).
FORMULA
a(n) = a(n-33). - G. C. Greubel, Mar 30 2016
MATHEMATICA
PowerMod[Range[0, 100], 3, 33] (* G. C. Greubel, Mar 30 2016 *)
PROG
(Sage) [power_mod(n, 3, 33) for n in range(0, 76)] # Zerinvary Lajos, Oct 30 2009
(Magma) [Modexp(n, 3, 33): n in [0..100]]; // Vincenzo Librandi, Mar 31 2016
(PARI) a(n)=n^3%33 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A373837 A304636 A115169 * A270421 A056729 A070265
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved