login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A076837 Triangle T(n,k) read by rows giving number of inequivalent projective indecomposable binary linear [n,k] codes (n >= 1, 1 <= k <= n). 1
1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 2, 1, 0, 0, 1, 4, 3, 1, 0, 0, 0, 5, 9, 4, 1, 0, 0, 0, 5, 22, 19, 6, 1, 0, 0, 0, 4, 40, 70, 35, 7, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,15
COMMENTS
A code is projective if all columns are distinct and nonzero.
REFERENCES
D. Slepian, Some further theory of group codes. Bell System Tech. J. 39 1960 1219-1252.
LINKS
EXAMPLE
1; 0; 0,1; 0,0,1; 0,0,1,1; 0,0,1,2,1; 0,0,1,4,3,1; 0,0,0,5,9,4,1; ...
CROSSREFS
Cf. A076838 (row sums).
Sequence in context: A255517 A188816 A168312 * A055363 A363845 A350681
KEYWORD
nonn,tabf,more
AUTHOR
N. J. A. Sloane, Nov 21 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 07:57 EDT 2024. Contains 371698 sequences. (Running on oeis4.)