login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A205126 s(k)-s(j), where (s(k),s(j)) is the least such pair for which n divides their difference, and s(j)= j*(2^(j-1)). 3

%I

%S 3,8,3,8,20,48,28,8,180,20,11,48,416,28,180,48,68,180,76,20,5040,1012,

%T 368,48,2300,416,11232,28,1856,180,31,160,1023,68,5040,180,444,76,

%U 11232,160,41984,5040,524256,1012,180,368,188,48,2303,2300,1020

%N s(k)-s(j), where (s(k),s(j)) is the least such pair for which n divides their difference, and s(j)= j*(2^(j-1)).

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

%t (See the program at A205122.)

%Y Cf. A205122, A204892.

%K nonn

%O 1,1

%A _Clark Kimberling_, Jan 25 2012

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 February 18 21:20 EST 2020. Contains 332028 sequences. (Running on oeis4.)