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!)
A205121 Least k such that n divides a difference between distinct numbers j*(2^(j-1)), when ordered as in A205120. 1
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, 5, 35, 13, 4, 14, 22, 9, 41, 13, 17, 8, 49, 14, 77, 41, 109, 24, 13, 20, 12, 10, 29, 30, 23, 19, 40, 49, 73, 15, 80, 35, 26, 13, 117, 25, 41, 21, 123, 34, 93, 9, 58, 41 (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: A058659 A053642 A171961 * A152903 A226522 A122507

Adjacent sequences:  A205118 A205119 A205120 * A205122 A205123 A205124

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 March 30 22:55 EDT 2020. Contains 333132 sequences. (Running on oeis4.)