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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A004045 Minimal size of binary code of length n such that every vector is within distance 1 of at least 2 codewords. 0
2, 3, 4, 8, 12, 20, 32 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

Table of n, a(n) for n=1..7.

H. Hamalainen et al., Football pools - a game for mathematicians, Amer. Math. Monthly, 102 (1995), 579-588.

EXAMPLE

From Paul Tabatabai, Mar 02 2020: (Start)

Lexicographically first optimal code for n = 6:

0 1 2 4 8 23 27 29 30 31 39 43 45 46 47 48 49 50 52 56.

Lexicographically first optimal code for n = 7:

0 1 6 7 24 25 30 31 42 43 44 45 50 51 52 53 74 75 76 77 82 83 84 85 96 97 102 103 120 121 126 127. (End)

CROSSREFS

Sequence in context: A222124 A222125 A222126 * A060200 A057608 A060984

Adjacent sequences:  A004042 A004043 A004044 * A004046 A004047 A004048

KEYWORD

nonn,hard,more

AUTHOR

N. J. A. Sloane

EXTENSIONS

a(6)-a(7) from Paul Tabatabai, Mar 02 2020

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
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 14 03:42 EDT 2020. Contains 335716 sequences. (Running on oeis4.)