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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A291953 Number of unordered pairs of edge-disjoint trees on n labeled vertices. 1
1, 0, 0, 6, 570, 73620, 13675620, 3540401760, 1229855690952, 554518177819200, 315663337023994080, 221736991132524890880, 188570961922698640977120, 191056359142016559185938944, 227491517759156008014967128000 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,4
LINKS
J. W. Moon, The second moment of the complexity of a graph, Mathematika 11:2 (1964), 95-98.
FORMULA
For n>1, a(n) = A291952(n)/2.
CROSSREFS
Cf. A291952.
Sequence in context: A226263 A029590 A332156 * A225206 A268207 A268247
KEYWORD
nonn
AUTHOR
Max Alekseyev, Sep 06 2017
STATUS
approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 23 13:41 EDT 2024. Contains 371914 sequences. (Running on oeis4.)