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



(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190013 An optimal 2-radius sequence over a (2p)-element alphabet for p = 5. 0


%S 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

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

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

%H S. P. Ghosh, <a href="http://dx.doi.org/10.1145/360933.360991">Consecutive storage of relevant records with redundancy</a>, Comm. ACM 18 (8) (1975) 464-471.

%H Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski, <a href="http://arxiv.org/abs/1105.0654">Constructions of asymptotically shortest k-radius sequences</a>, arXiv:1105.0654 [math.CO], 2011.

%H J. Jaromczyk, and Z. Lonc, <a href="http://dx.doi.org/10.1007/978-3-540-30551-4_52">Sequences of radius k: how to fetch many huge objects into small memory for pairwise computations</a>, 15th International Symposium, ISAAC 2004, Hong Kong, Lecture Notes in Computer Science 3341 (2004) 594-605.

%K nonn,fini,full

%O 1,3

%A _Jonathan Vos Post_, May 04 2011

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 23 11:24 EDT 2021. Contains 347612 sequences. (Running on oeis4.)