The OEIS is supported by the many generous donors to the OEIS Foundation.

 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 59th year, we have over 358,000 sequences, and we’ve crossed 10,300 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A070459 a(n) = n^2 mod 37. 1
 0, 1, 4, 9, 16, 25, 36, 12, 27, 7, 26, 10, 33, 21, 11, 3, 34, 30, 28, 28, 30, 34, 3, 11, 21, 33, 10, 26, 7, 27, 12, 36, 25, 16, 9, 4, 1, 0, 1, 4, 9, 16, 25, 36, 12, 27, 7, 26, 10, 33, 21, 11, 3, 34, 30, 28, 28, 30, 34, 3, 11, 21, 33, 10, 26, 7, 27, 12, 36, 25, 16, 9, 4, 1, 0, 1, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS This is sequence repeat(0, S, reverse(S)), with S := Sequence(a(n), n = 1..18). [0, ordered(S)] is A010398. - Wolfdieter Lang, Jun 24 2019 LINKS G. C. Greubel, Table of n, a(n) for n = 0..1000 FORMULA a(n) = a(n-37). - G. C. Greubel, Mar 25 2016 MATHEMATICA PowerMod[Range[0, 110], 2, 37] (* Harvey P. Dale, Aug 22 2015 *) PROG (PARI) a(n)=n^2%37 \\ Charles R Greathouse IV, Apr 06 2016 (Scala) (0 to 99).map(n => (n * n) % 37) // Alonso del Arte, Jun 24 2019 CROSSREFS Cf. A010398, A070456, A070457. Sequence in context: A070462 A070461 A070460 * A292676 A241971 A335640 Adjacent sequences: A070456 A070457 A070458 * A070460 A070461 A070462 KEYWORD nonn,easy AUTHOR N. J. A. Sloane, May 12 2002 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified December 3 19:41 EST 2022. Contains 358543 sequences. (Running on oeis4.)