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!)
A205380 Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=(2j-1)^2. 2

%I #5 Mar 30 2012 18:58:10

%S 9,9,25,9,49,25,81,9,81,49,169,25,225,81,121,25,361,81,441,49,169,169,

%T 625,25,225,225,225,81,961,121,1089,81,289,361,289,81,1521,441,361,49,

%U 1849,169,2025,169,361,625,2401,49,441,225,529,225,3025,225

%N Least s(k) such that n divides s(k)-s(j) for some j<k, where s(j)=(2j-1)^2.

%C For a guide to related sequences, see A204892.

%t (See the program at A205378.)

%Y Cf. A205378, A204892.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 26 2012

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 11:39 EDT 2024. Contains 371969 sequences. (Running on oeis4.)