

A190013


An optimal 2radius sequence over a (2p)element alphabet for p = 5.


0



0, 1, 3, 0, 2, 4, 1, 3, 0, 2, 4, 1, 2, 3, 4, 0, 1, 2, 3, 4, 0, 0, 2, 2, 3, 3, 4, 4, 1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,3


COMMENTS

Constructed on p. 21 of Jaromczyk. Let k be a positive integer. A sequence s over an nelement alphabet A is called a kradius sequence if every two symbols from A occur in s at distance of at most k. Generalizes Ghosh, 1975.


LINKS



CROSSREFS



KEYWORD

nonn,fini,full


AUTHOR



STATUS

approved



