

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

Table of n, a(n) for n=1..30.
S. P. Ghosh, Consecutive storage of relevant records with redundancy, Comm. ACM 18 (8) (1975) 464471.
Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski, Constructions of asymptotically shortest kradius sequences, arXiv:1105.0654, May 3 2011.
J. Jaromczyk, and Z. Lonc, Sequences of radius k: how to fetch many huge objects into small memory for pairwise computations, 15th International Symposium, ISAAC 2004, Hong Kong, Lecture Notes in Computer Science 3341 (2004) 594605.


CROSSREFS

Sequence in context: A113069 A136163 A178313 * A171088 A058624 A145856
Adjacent sequences: A190010 A190011 A190012 * A190014 A190015 A190016


KEYWORD

nonn,fini,full


AUTHOR

Jonathan Vos Post, May 04 2011


STATUS

approved



