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

 


A070459
a(n) = n^2 mod 37.
2
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
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
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, 1).
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
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane, May 12 2002
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 22 11:40 EDT 2024. Contains 376114 sequences. (Running on oeis4.)