Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A088974
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A088974 Number of (nonisomorphic) connected bipartite graphs with minimum degree at least 2 and with n vertices. +0
1
0, 0, 0, 1, 1, 5, 9, 45, 160, 1018, 6956 (list; graph; listen)
OFFSET

1,6

COMMENT

The terms were computed using the program Nauty.

LINKS

Brendan McKay, Nauty

CROSSREFS

Sequence in context: A123822 A121724 A100305 this_sequence A105182 A100457 A080872

Adjacent sequences: A088971 A088972 A088973 this_sequence A088975 A088976 A088977

KEYWORD

nonn

AUTHOR

Felix Goldberg (felixg(AT)tx.technion.ac.il), Oct 30 2003

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research