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!)
A061369 a(n) = smallest square in the arithmetic progression {nk+1 : k > 0}. 0

%I #7 Feb 11 2023 20:32:03

%S 4,9,4,9,16,25,36,9,64,81,100,25,144,169,16,49,256,289,324,81,64,441,

%T 484,25,576,625,676,169,784,121,900,225,100,1089,36,289,1296,1369,196,

%U 81,1600,169,1764,441,361,2025,2116,49,2304,2401,256,625,2704,2809,441

%N a(n) = smallest square in the arithmetic progression {nk+1 : k > 0}.

%F a(n)=Min{x^2 : x^2=nk+1}

%e Each square q appears in several progressions, i.e. in A000005(q-1) cases. Not necessarily as a first square. E.g. q=81 is minimal in {10k+1},{20k+1},{40k+1},{80k+1}, while not minimal in {3k+1} and 5 other progressions. In {16k+1} 49 comes before 81.

%K nonn

%O 1,1

%A _Labos Elemer_, Jun 08 2001

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 April 25 09:38 EDT 2024. Contains 371967 sequences. (Running on oeis4.)