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

A070468
a(n) = n^2 mod 46.
1
0, 1, 4, 9, 16, 25, 36, 3, 18, 35, 8, 29, 6, 31, 12, 41, 26, 13, 2, 39, 32, 27, 24, 23, 24, 27, 32, 39, 2, 13, 26, 41, 12, 31, 6, 29, 8, 35, 18, 3, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 36, 3, 18, 35, 8, 29, 6, 31, 12, 41, 26, 13, 2, 39, 32, 27, 24, 23, 24, 27, 32, 39, 2, 13, 26, 41
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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1).
FORMULA
a(n) = a(n-46). - G. C. Greubel, Mar 26 2016
MATHEMATICA
Table[Mod[n^2, 46], {n, 0, 100}] (* G. C. Greubel, Mar 26 2016 *)
PowerMod[Range[0, 100], 2, 46] (* Harvey P. Dale, Dec 13 2024 *)
PROG
(Magma) [Modexp(n, 2, 46 ): n in [0..100]]; // Vincenzo Librandi, Mar 27 2016
(PARI) a(n)=n^2%46 \\ Charles R Greathouse IV, Apr 06 2016
CROSSREFS
Sequence in context: A052118 A070470 A070469 * A070467 A070466 A070465
KEYWORD
nonn,easy,changed
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved