A156802 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

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

Other ways to Give

A156802

Number of equivalence classes of connected bipartite graphs on n nodes up to sequences of edge local complementation and isomorphism.

1, 1, 1, 2, 3, 8, 15, 43, 110, 370, 1260, 5366, 25684, 154104, 1156716

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,4

COMMENTS

Also equal to the number of inequivalent indecomposable binary linear codes of length n plus the number of inequivalent indecomposable isodual binary linear codes of length n, divided by two.

LINKS

Table of n, a(n) for n=1..15.

L. E. Danielsen and M. G. Parker, Edge local complementation and equivalence of binary linear codes, Des. Codes Cryptogr., 49 (2008), 161-170.

L. E. Danielsen, Database of Pivot Orbits.

CROSSREFS

A076836

Sequence in context: A148004 A300443 A321231 * A148005 A151394 A148006

Adjacent sequences: A156799 A156800 A156801 * A156803 A156804 A156805

KEYWORD

hard,nonn

AUTHOR

Lars Eirik Danielsen (larsed(AT)ii.uib.no), Feb 16 2009

STATUS

approved