%I #15 Oct 31 2025 13:13:11

%S 16,122,549,1837,5069,12203,26510,53141,99840,177811,302759,496128,

%T 786545,1211476,1819136,2670647,3842461,5429083,7546084,10333440,

%U 13959209,18623545,24563096,32055772,41425920,53049910,67362149,84861549,106118453,131782042,162588234

%N Graham-Sloane-type lower bound on the size of a ternary (n,3,8) constant-weight code.

%H Mattias Svanstrom, <a href="https://doi.org/10.1109/18.623164">A lower bound for ternary constant weight codes</a>, IEEE Trans. on Information Theory, Vol. 43 (Sep. 1997), pp. 1630-1632.

%F a(n) = ceiling(binomial(n, w) * 2^w / (2*n + 1)) with w = 8.

%t a[n_] := Ceiling[Binomial[n, 8] * 2^8 / (2*n + 1)]; Array[a, 40, 8] (* _Amiram Eldar_, Oct 31 2025 *)

%Y Column k=8 of A390161.

%K nonn,easy

%O 8,1

%A Mattias Svanstrom (mattias(AT)isy.liu.se)