login
This site is supported by donations to The OEIS Foundation.

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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.

LINKS

Table of n, a(n) for n=0..25.

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

Cf. A076766, A000079, A250002.

Sequence in context: A158608 A282084 A262768 * A320935 A320936 A320937

Adjacent sequences:  A250000 A250001 A250002 * A250004 A250005 A250006

KEYWORD

nonn

AUTHOR

Tilman Piesk, Nov 10 2014

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 15:11 EST 2019. Contains 329960 sequences. (Running on oeis4.)