login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A091006
Triangle T(n,k) read by rows giving number of inequivalent indecomposable binary linear [n,k] codes with all columns distinct (projective codes) (n >= 1, 1 <= k <= n).
0
1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 2, 1, 0, 0, 0, 1, 4, 3, 1, 0, 0, 0, 0, 5, 9, 4, 1, 0, 0, 0, 0, 5, 22, 19, 6, 1, 0, 0, 0, 0, 4, 40, 70, 35, 7, 1, 0, 0, 0, 0, 3, 60, 220, 190, 59, 9, 1, 0, 0, 0, 0, 2, 86, 629, 977, 466, 96, 11, 1, 0, 0, 0, 0, 1, 110, 1700
OFFSET
1,19
EXAMPLE
1; 0,0; 0,1,0; 0,0,1,0; 0,0,1,1,0; 0,0,1,2,1,0; ...
CROSSREFS
Sequence in context: A127841 A017847 A350753 * A350433 A373480 A167365
KEYWORD
nonn,tabl
AUTHOR
N. J. A. Sloane, Mar 01 2004
STATUS
approved