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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A304070 Number of simple graphs with n vertices rooted at a pair of distinguished vertices. 5
 0, 2, 8, 40, 240, 1992, 24416, 483040, 16343872, 982635280, 106979975168, 21285548190080, 7783083940331520, 5254164116114948480, 6577258363669088914432, 15332656940815954900371968, 66830735142688170751257497600, 546722015615195079134707942219904 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The graphs do not need to be connected. LINKS Andrew Howroyd, Table of n, a(n) for n = 1..50 FORMULA a(n) = 2*A304069(n). EXAMPLE a(3)=8: 1 for the graph with no edge, 3 for the graph with one edge, 3 for the graph with two edges, 1 for the triangle. CROSSREFS Cf. A304074 (for connected graphs), A000088 (not rooted). Sequence in context: A055882 A002301 A319949 * A349105 A259869 A321733 Adjacent sequences: A304067 A304068 A304069 * A304071 A304072 A304073 KEYWORD nonn AUTHOR Brendan McKay, May 05 2018 EXTENSIONS Terms a(13) and beyond from Andrew Howroyd, May 06 2018 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.

Last modified March 22 20:34 EDT 2023. Contains 361433 sequences. (Running on oeis4.)