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!)
 A122002 a(0)=5; otherwise a(n) = (n mod 4) if n is odd, a(n) = h + 4, where h = (highest odd divisor of n) mod 4 if n is even. 0
 5, 1, 5, 3, 5, 1, 7, 3, 5, 1, 5, 3, 7, 1, 7, 3, 5, 1, 5, 3, 5, 1, 7, 3, 7, 1, 5, 3, 7, 1, 7, 3, 5, 1, 5, 3, 5, 1, 7, 3, 5, 1, 5, 3, 7, 1, 7, 3, 7, 1, 5, 3, 5, 1, 7, 3, 7, 1, 5, 3, 7, 1, 7, 3, 5, 1, 5, 3, 5, 1, 7, 3, 5, 1, 5, 3, 7, 1, 7, 3, 5, 1, 5, 3, 5, 1, 7, 3, 7, 1, 5, 3, 7, 1, 7, 3, 7, 1, 5, 3, 5 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS a(n) in {1,3,5,7} for all n. a(4k+i) = i if i is odd. There is a typo in Grytczuk's definition: he has "+ 5" instead of "+ 4". LINKS A. Carpi, Multidimensional unrepetitive configurations, Theoret. Comput. Sci., 56 (1988), 233-241. Jaroslaw Grytczuk, Thue type problems for graphs, points and numbers, Discrete Math., 308 (2008), 4419-4429. [See Problem 15.] CROSSREFS Sequence in context: A217774 A060186 A240995 * A322602 A228639 A073226 Adjacent sequences:  A121999 A122000 A122001 * A122003 A122004 A122005 KEYWORD nonn AUTHOR N. J. A. Sloane, Aug 05 2008 EXTENSIONS Terms from a(26) on from John W. Layman, Aug 27 2008 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 February 25 12:01 EST 2020. Contains 332233 sequences. (Running on oeis4.)