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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A202208 Smallest square (>4n) == 1 mod 4n. 0

%I #11 Oct 30 2018 10:31:02

%S 9,9,25,49,81,25,169,225,289,81,441,49,625,169,121,961,1089,289,1369,

%T 81,169,441,2025,289,2401,625,2809,225,3249,121,3721,3969,529,1089,

%U 841,289,5329,1369,625,961,6561,169,7225,529,361,2025,8649,961,9409,2401

%N Smallest square (>4n) == 1 mod 4n.

%C This is to squares as A070848 to primes.

%o (PARI) {nn=100;for(n=1,nn,s=1+4*n;while(!issquare(s),s=s+4*n); print1(s,", "))}

%Y Cf. A070848.

%K nonn

%O 1,1

%A _Zak Seidov_, Dec 14 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 14 16:37 EDT 2024. Contains 375166 sequences. (Running on oeis4.)