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

 

Logo

Many excellent designs for a new banner were submitted. We will use the best of them in rotation.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A007833 Number of point-labeled reduced two-graphs with n nodes. 2
1, 0, 1, 1, 28, 448, 18788, 1419852, 207249896, 58206408344, 31725488477648, 33830818147141904, 71068681534173472576, 295648155633330113713344, 2444510010072634827916776064 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,5

COMMENTS

Also number of (n-1)-node labeled mating graphs without isolated nodes, cf. A006024. - Vladeta Jovovic, Mar 23 2004

LINKS

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

P. J. Cameron, Counting two-graphs related to trees, Elec. J. Combin., Vol. 2, #R4.

CROSSREFS

Sequence in context: A125485 A054337 A009685 * A080315 A022752 A000771

Adjacent sequences:  A007830 A007831 A007832 * A007834 A007835 A007836

KEYWORD

nonn

AUTHOR

Peter J. Cameron

STATUS

approved

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

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

Last modified April 20 13:52 EDT 2014. Contains 240806 sequences.