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”).

A250003
Number of inequivalent binary linear codes of length n minus 2^n.
1
0, 0, 0, 0, 0, 0, 4, 20, 86, 336, 1273, 4880, 19938, 90662, 486753, 3285964, 29643278, 373908194, 6739368109, 173801125420, 6356254132640, 326203515419552, 23294352975946580, 2301176047756537128, 313285408199163993419, 58638266023262469408284
OFFSET
0,7
COMMENTS
The numbers of inequivalent binary linear codes of length n (A076766) start like the powers of two (A000079). This sequence is their difference. These are the row sums of the triangle A250002.
FORMULA
a(n) = A076766(n) - A000079(n).
EXAMPLE
There are 342 inequivalent binary linear codes of length 8, and 2^8 = 256, hence a(8) = 342 - 256 = 86.
CROSSREFS
KEYWORD
nonn
AUTHOR
Tilman Piesk, Nov 10 2014
STATUS
approved