login
This site is supported by donations to The OEIS Foundation.

 

Logo

"Email this user" was broken Aug 14 to 9am Aug 16. If you sent someone a message in this period, please send it again.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A190013 An optimal 2-radius 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 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.

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) 464-471.

Jerzy W. Jaromczyk, Zbigniew Lonc, Miroslaw Truszczynski, Constructions of asymptotically shortest k-radius 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) 594-605.

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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified August 20 13:04 EDT 2017. Contains 290835 sequences.