The classic football pool problem: size of minimal covering code in {0,1,2}^n with covering radius 1.
A004044
The classic football pool problem: size of minimal covering code in {0,1,2}^n with covering radius 1.
Terms
- a(0) =1a(1) =1a(2) =3a(3) =5a(4) =9a(5) =27
External references
- oeis: A004044