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!)
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
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, 32, 4, 448, 12, 1, 32, 1, 12, 80, 12, 4, 4, 32, 32, 11264, 80, 32, 12, 12, 80, 4, 32, 1, 4, 4, 32, 32, 32, 448, 80, 4, 448, 80, 12, 24576, 32, 80, 192, 12, 192, 4, 12, 12, 80 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For a guide to related sequences, see A204892.

LINKS

Table of n, a(n) for n=1..70.

MATHEMATICA

(See the program at A205122.)

CROSSREFS

Cf. A205122, A204892.

Sequence in context: A132478 A208918 A228782 * A248978 A143461 A066808

Adjacent sequences:  A205122 A205123 A205124 * A205126 A205127 A205128

KEYWORD

nonn

AUTHOR

Clark Kimberling, Jan 25 2012

STATUS

approved

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 09:39 EST 2020. Contains 332011 sequences. (Running on oeis4.)