login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010422 Squares mod 61. 0
0, 1, 3, 4, 5, 9, 12, 13, 14, 15, 16, 19, 20, 22, 25, 27, 34, 36, 39, 41, 42, 45, 46, 47, 48, 49, 52, 56, 57, 58, 60 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

That is, numbers 0 <= n < 61 such that n is a square modulo 61.

LINKS

Table of n, a(n) for n=1..31.

MATHEMATICA

Union[Mod[Range[0, 60]^2, 61]] (* T. D. Noe, Apr 21 2011 *)

Union[PowerMod[Range[0, 600], 2, 61]] (* Harvey P. Dale, May 22 2014 *)

PROG

(Sage) [quadratic_residues(61)] # Zerinvary Lajos, May 24 2009

(PARI) for(n=0, 60, if(issquare(Mod(n, 61)), print1(n", "))) \\ Franklin T. Adams-Watters, Apr 21 2011

CROSSREFS

Sequence in context: A035247 A039885 A239197 * A287792 A050033 A243654

Adjacent sequences:  A010419 A010420 A010421 * A010423 A010424 A010425

KEYWORD

nonn,fini,full

AUTHOR

N. J. A. Sloane

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 21 11:15 EDT 2019. Contains 323443 sequences. (Running on oeis4.)