A Meet-in-the-Middle Algorithm for Finding Extremal Restricted Additive 2-Bases
Jukka Kohonen
Department of Mathematics and Statistics
P. O. Box 68
FI-00014 University of Helsinki
Finland
Abstract:
An additive 2-basis with range n is restricted if its largest
element is n/2. Among the restricted 2-bases of given length k,
the ones that have the greatest range are extremal restricted.
We describe an algorithm that finds the extremal restricted 2-bases of
a given length, and we list them for lengths up to k = 41.
Full version: pdf,
dvi,
ps,
latex
(Concerned with sequences
A001212
A006638
A167809.)
Received March 17 2014;
revised version received May 20 2014.
Published in Journal of Integer Sequences, May 20 2014.
Return to
Journal of Integer Sequences home page
