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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A156802 Number of equivalence classes of connected bipartite graphs on n nodes up to sequences of edge local complementation and isomorphism. 0
1, 1, 1, 2, 3, 8, 15, 43, 110, 370, 1260, 5366, 25684, 154104, 1156716 (list; graph; refs; listen; history; 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

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: A148002 A148003 A148004 * 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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 16:49 EST 2012. Contains 206058 sequences.