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.

This page as a plain text file.
%I A250003 #15 Nov 28 2014 22:26:14
%S A250003 0,0,0,0,0,0,4,20,86,336,1273,4880,19938,90662,486753,3285964,
%T A250003 29643278,373908194,6739368109,173801125420,6356254132640,
%U A250003 326203515419552,23294352975946580,2301176047756537128,313285408199163993419,58638266023262469408284
%N A250003 Number of inequivalent binary linear codes of length n minus 2^n.
%C A250003 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.
%F A250003 a(n) = A076766(n) - A000079(n).
%e A250003 There are 342 inequivalent binary linear codes of length 8, and 2^8 = 256, hence a(8) = 342 - 256 = 86.
%Y A250003 Cf. A076766, A000079, A250002.
%K A250003 nonn
%O A250003 0,7
%A A250003 _Tilman Piesk_, Nov 10 2014