login
Triangle E(n,k), 1<=k<=n, giving the cardinality of optimal ternary covering codes of empty spheres of length n and radius k
3

%I #30 Mar 10 2018 08:35:20

%S 2,3,3,6,4,5,14,6,5,8,27,12,6,7,12

%N Triangle E(n,k), 1<=k<=n, giving the cardinality of optimal ternary covering codes of empty spheres of length n and radius k

%C The next term is in the range 71-81.

%C Right diagonal is equal to A086676.

%H Jernej Azarija, M. A. Henning, S. Klavzar, <a href="https://arxiv.org/abs/1606.08143">(Total) Domination in Prisms</a>, arXiv preprint arXiv:1606.08143 [math.CO], 2016.

%H Jernej Azarija, S. Klavzar, Y. Rho, S. Sim, <a href="https://www.fmf.uni-lj.si/~klavzar/preprints/Total-dom-cubes-submit.pdf">On domination-type invariants of Fibonacci cubes and hypercubes</a>, Preprint 2016.

%H Jernej Azarija, S. Klavzar, Y. Rho, S. Sim, <a href="https://amc-journal.eu/index.php/amc/article/view/1172">On domination-type invariants of Fibonacci cubes and hypercubes</a>, Ars Mathematica Contemporanea, 14 (2018) 387-395.

%H Kamiel P. F. Verstraten, <a href="/A238305/a238305.pdf">A generalization of the football pool problem</a>, Master's Thesis, Tilburg University, 2014.

%e Triangle starts:

%e 01: 2

%e 02: 3 3

%e 03: 6 4 5

%e 04: 14 6 5 8

%e 05: 27 12 6 7 12

%e ...

%Y Related to A060439, which has a code consisting of filled spheres instead of empty spheres.

%Y Related to A230014, the triangle giving the cardinality of optimal binary covering codes of empty spheres.

%Y See also A000983.

%K nonn,hard,more,tabl

%O 1,1

%A _Kamiel P.F. Verstraten_, Feb 24 2014