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

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

Offset: 1

Author

Kamiel P.F. Verstraten, Feb 24 2014

Keywords

• nonn
• hard
• more
• tabl

Comments

The next term is in the range 71-81.

Right diagonal is equal to A086676.

Examples

			Triangle starts:
01: 2
02: 3 3
03: 6 4 5
04: 14 6 5 8
05: 27 12 6 7 12
...
		

Links

• Jernej Azarija, M. A. Henning, S. Klavzar, (Total) Domination in Prisms, arXiv preprint arXiv:1606.08143 [math.CO], 2016.
• Jernej Azarija, S. Klavzar, Y. Rho, S. Sim, On domination-type invariants of Fibonacci cubes and hypercubes, Preprint 2016.
• Jernej Azarija, S. Klavzar, Y. Rho, S. Sim, On domination-type invariants of Fibonacci cubes and hypercubes, Ars Mathematica Contemporanea, 14 (2018) 387-395.
• Kamiel P. F. Verstraten, A generalization of the football pool problem, Master's Thesis, Tilburg University, 2014.

Crossrefs

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

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

See also A000983.