cp's OEIS Frontend

A230014 Triangle E(n,k), 1<=k<=n, giving the cardinality of optimal binary covering codes of empty spheres of length n and radius k.

%I A230014 #28 Jun 18 2015 10:10:44
%S A230014 2,2,4,4,4,8,4,4,4,16,8,6,6,8,32,14,8,6,8,14,64,24,8,8,8,8,24,128,32,
%T A230014 16,8,8,8,16,32,256,64,24,12,10,10,12,24,64,512,124
%N A230014 Triangle E(n,k), 1<=k<=n, giving the cardinality of optimal binary covering codes of empty spheres of length n and radius k.
%C A230014 The next term is in the range 34-40.
%C A230014 Note that E(n,k) = E(n,n-k).
%H A230014 Kamiel P. F. Verstraten, <a href="https://oeis.org/A238305/a238305.pdf">A Generalization of the Football Pool Problem</a>, Master's Thesis, Tilburg University, 2014
%e A230014 Triangle starts:
%e A230014 01: 2,
%e A230014 02: 2, 4,
%e A230014 03: 4, 4, 8,
%e A230014 04: 4, 4, 4, 16,
%e A230014 05: 8, 6, 6, 8, 32,
%e A230014 06: 14, 8, 6, 8, 14, 64,
%e A230014 07: 24, 8, 8, 8, 8, 24, 128,
%e A230014 08: 32, 16, 8, 8, 8, 16, 32, 256,
%e A230014 09: 64, 24, 12, 10, 10, 12, 24, 64, 512,
%e A230014 10: 124, ...
%Y A230014 Related to A060438, which has a code consisting of filled spheres instead of empty spheres.
%Y A230014 Related to A238305, the triangle giving the cardinality of optimal ternary covering codes of empty spheres.
%Y A230014 The first column is equal to 2*A000983.
%K A230014 nonn,hard,more,tabl
%O A230014 1,1
%A A230014 _Kamiel P.F. Verstraten_, Feb 22 2014
%E A230014 a(43) corrected by _Omar E. Pol_, Nov 23 2014