A192516 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A192516

Number of line graphs on [1,...,n].

1, 1, 2, 8, 62, 739, 11660, 229003, 5487341, 157413957, 5310060277, 207442849742, 9266622204859, 468316344074444, 26534795158872607, 1672482335988644162, 116473621430584439236, 8908899406447047324336, 744489132650874081005467

(list; graph; refs; listen; history; text; internal format)

OFFSET

0,3

LINKS

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

Peter Cameron, Thomas Prellberg, Dudley Stark, Asymptotic enumeration of 2-covers and line graphs, Discrete Math. 310 (2010), no. 2, 230-240 (see l_n).

FORMULA

E.g.f. = exp(-x^3/6-x^4/6-x^5/8-x^6/48)*U(x), where U(x) is the e.g.f. for A014500.

CROSSREFS

Cf. A014500.

Sequence in context: A132574 A086903 A161566 * A159476 A230824 A006245

Adjacent sequences: A192513 A192514 A192515 * A192517 A192518 A192519

KEYWORD

nonn

AUTHOR

N. J. A. Sloane, Jul 03 2011

STATUS

approved