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

A070455
a(n) = n^2 mod 33.
2
0, 1, 4, 9, 16, 25, 3, 16, 31, 15, 1, 22, 12, 4, 31, 27, 25, 25, 27, 31, 4, 12, 22, 1, 15, 31, 16, 3, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 3, 16, 31, 15, 1, 22, 12, 4, 31, 27, 25, 25, 27, 31, 4, 12, 22, 1, 15, 31, 16, 3, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 3, 16, 31, 15, 1, 22, 12, 4
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, 1).
FORMULA
a(n) = a(n-33). - G. C. Greubel, Mar 24 2016
MATHEMATICA
Table[Mod[n^2, 33], {n, 0, 200}] (* Vladimir Joseph Stephan Orlovsky, Apr 27 2011 *)
PROG
(PARI) a(n)=n^2%33 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved