|
Search: id:A122002
|
|
|
| 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
1
|
|
| 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; listen)
|
|
|
OFFSET
|
0,1
|
|
|
COMMENT
|
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".
|
|
REFERENCES
|
A. Carpi, Multidimensional unrepetitive configurations, Theoret. Comput. Sci., 56 (1988), 233-241.
J. Grytczuk, Thue type problems for graphs, points and numbers, Discrete Math., 308 (2008), 4419-4429. [See Problem 15.]
|
|
CROSSREFS
|
Sequence in context: A021955 A055191 A060186 this_sequence A073226 A021198 A143969
Adjacent sequences: A121999 A122000 A122001 this_sequence A122003 A122004 A122005
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Aug 05 2008
|
|
EXTENSIONS
|
Terms from a(26) on from John W. Layman (layman(AT)math.vt.edu), Aug 27 2008
|
|
|
Search completed in 0.002 seconds
|
