login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A086314 Total number of edges in the distinct simple graphs on n nodes. 2
0, 1, 6, 33, 170, 1170, 10962, 172844, 4944024, 270116280, 28022441260, 5448008695536, 1969579223350128, 1321964082404214704, 1649890513414726210320, 3840060942271653473695680, 16723638762440239422492944768, 136749695973639295091912681599872 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

COMMENTS

a(n) = A000088(n)*n(n-1)/4.

a(n) = A000088(n)*A064038(n)/A014695(n).

LINKS

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

Eric Weisstein's World of Mathematics, Simple Graph

Eric Weisstein's World of Mathematics, Graph Edge

MATHEMATICA

<< Combinatorica`; Table[D[GraphPolynomial[n, x], x] /. x -> 1, {n, 18}]  (* Geoffrey Critzer, Sep 29 2012 *)

<< Combinatorica`; Table[Binomial[n, 2] NumberOfGraphs[n]/2, {n, 18}] (* Eric W. Weisstein, May 17 2017 *)

CROSSREFS

Cf. A000088, A014695, A064038.

Sequence in context: A291004 A203155 A084153 * A086091 A081893 A106850

Adjacent sequences:  A086311 A086312 A086313 * A086315 A086316 A086317

KEYWORD

nonn

AUTHOR

Eric W. Weisstein, Jul 15 2003

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 30 17:21 EDT 2021. Contains 346359 sequences. (Running on oeis4.)