The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #11 Nov 14 2023 10:02:19
%S 2,4,8,17,36,85,216,640,2292,9665,80836,1070709,27652010,1345914266,
%T 115596164732
%N Number of inequivalent ternary linear codes of length n. Also the number of nonisomorphic ternary matroids on an n-set.
%D M. Wild, Enumeration of binary and ternary matroids and other applications of the Brylawski-Lucas theorem, Technische Hochschule Darmstadt, Preprint 1693, 1994
%H Jayant Apte and J. M. Walsh, <a href="http://arxiv.org/abs/1605.04598">Constrained Linear Representability of Polymatroids and Algorithms for Computing Achievability Proofs in Network Coding</a>, arXiv preprint arXiv:1605.04598 [cs.IT], 2016-2017.
%e The two linear ternary codes of length 3, {(0,0,0), (1,-1,0), (-1,1,0) } and {(0,0,0), (-1,0,-1), (1,0,1) } are equivalent because the latter arises from the former by changing the sign of the first component of every codeword and switching the second with the third component.
%Y Cf. A076766.
%K nonn,more
%O 1,1
%A Marcel Wild (mwild(AT)sun.ac.za), Nov 26 2002
%E a(9) corrected by _Gordon Royle_, Oct 27 2007