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!)
A205121 Least k such that n divides a difference between distinct numbers j*(2^(j-1)), when ordered as in A205120. 1

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

%S 1,3,1,3,6,10,5,3,13,6,2,10,19,5,13,10,9,13,8,6,41,24,20,10,30,19,49,

%T 5,35,13,4,14,22,9,41,13,17,8,49,14,77,41,109,24,13,20,12,10,29,30,23,

%U 19,40,49,73,15,80,35,26,13,117,25,41,21,123,34,93,9,58,41

%N Least k such that n divides a difference between distinct numbers j*(2^(j-1)), when ordered as in A205120.

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

%t (See the program at A205122.)

%Y Cf. A205122, A204892.

%K nonn

%O 1,2

%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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 02:46 EDT 2024. Contains 371917 sequences. (Running on oeis4.)