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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A162537 a(n) = the smallest positive multiple of n where every length of the runs of 0's and 1's in the binary representation of a(n) is coprime to n. 2
 1, 2, 3, 8, 5, 42, 7, 8, 9, 10, 11, 672, 13, 14, 15, 32, 17, 522, 19, 40, 21, 682, 23, 672, 25, 130, 27, 56, 29, 2730, 31, 32, 33, 34, 35, 8352, 37, 190, 195, 40, 41, 42, 43, 2728, 45, 46, 47, 672, 49, 650, 51, 520, 53, 702, 55, 56, 171, 58, 59, 174720, 61, 62, 189, 128, 195, 8382, 67, 136, 207, 910, 71, 8352, 73, 3626, 75 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS By "run" of 0's or 1's, it is meant: Think of binary n as a string of 0's and 1's. A single run of the digit b (0 or 1) is made up completely of consecutive digits all equal to b, and is bounded on its ends by either the digit 1-b or by the edge of the string. LINKS EXAMPLE For n = 4, we check. 4 in binary is 100, which has a run of two 0's; and 2 is not coprime to 4. But 2*4 = 8 = 1000 in binary has a run of one 1 and a run of three 0's. Since both 1 and 3 are coprime to 4, then a(4) = 8. CROSSREFS Sequence in context: A007955 A324502 A170826 * A109844 A128779 A112283 Adjacent sequences:  A162534 A162535 A162536 * A162538 A162539 A162540 KEYWORD base,nonn AUTHOR Leroy Quet, Jul 05 2009 EXTENSIONS More terms from Sean A. Irvine, Jan 27 2011 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.

Last modified May 28 21:37 EDT 2020. Contains 334690 sequences. (Running on oeis4.)