cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A250003 Number of inequivalent binary linear codes of length n minus 2^n.

Original entry on oeis.org

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

Views

Author

Tilman Piesk, Nov 10 2014

Keywords

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.

Examples

			There are 342 inequivalent binary linear codes of length 8, and 2^8 = 256, hence a(8) = 342 - 256 = 86.
		

Crossrefs

Formula

a(n) = A076766(n) - A000079(n).