A001436 - OEIS

A001436

Number of connected graphs with n nodes, n+2 edges.
(Formerly M3583 N1453)

0, 0, 0, 1, 4, 22, 107, 486, 2075, 8548, 33851, 130365, 489387, 1799700, 6499706, 23118465, 81134475, 281454170, 966388692, 3288208176, 11098235911, 37188198356, 123800999503, 409715126169, 1348690034859, 4417932007626, 14407260221164

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

OFFSET

1,5

REFERENCES

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Sean A. Irvine, Table of n, a(n) for n = 1..40

M. L. Stein and P. R. Stein, Enumeration of Linear Graphs and Connected Linear Graphs up to p = 18 Points. Report LA-3775, Los Alamos Scientific Laboratory of the University of California, Los Alamos, NM, Oct 1967.

CROSSREFS

A diagonal of A054923.

Sequence in context: A099013 A184510 A184701 * A224243 A024420 A220457

Adjacent sequences: A001433 A001434 A001435 * A001437 A001438 A001439

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

EXTENSIONS

Description corrected Aug 02 1996.

More terms from Sean A. Irvine, Jul 23 2012

STATUS

approved