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!)
A205125 The number s(j) such that n divides s(k)-s(j), where s(j)=j*(2^(j-1)) and k is the least positive integer for which such a j>0 exists. 2

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

%S 1,4,1,4,12,32,4,4,12,12,1,32,32,4,12,32,12,12,4,12,80,12,80,32,4,32,

%T 32,4,448,12,1,32,1,12,80,12,4,4,32,32,11264,80,32,12,12,80,4,32,1,4,

%U 4,32,32,32,448,80,4,448,80,12,24576,32,80,192,12,192,4,12,12,80

%N The number s(j) such that n divides s(k)-s(j), where s(j)=j*(2^(j-1)) and k is the least positive integer for which such a j>0 exists.

%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 25 13:27 EDT 2024. Contains 371971 sequences. (Running on oeis4.)