login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A292300 Number of connected graphs with at least 2 and at most n nodes. 0
1, 3, 9, 30, 142, 995, 12112, 273192, 11989763, 1018690328, 165078520804, 50500986390023, 29053988449238084, 31426435131210480044, 64000986548356386656321, 245935832668632382906184889, 1787577661081567721273106761469, 24637809007060949223043923866443113 (list; graph; refs; listen; history; text; internal format)
OFFSET

2,2

COMMENTS

Partial sums of A001349 starting at n=2.

See Table 1 of Lauritzen et al.

LINKS

Table of n, a(n) for n=2..19.

Steffen Lauritzen, Alessandro Rinaldo, Kayvan Sadeghi, Random Networks, Graphical Models, and Exchangeability, arXiv:1701.08420 [math.ST], 2017.

CROSSREFS

Cf. A001349.

Sequence in context: A297198 A297202 A003604 * A058148 A031031 A034550

Adjacent sequences:  A292297 A292298 A292299 * A292301 A292302 A292303

KEYWORD

nonn

AUTHOR

Eric M. Schmidt, Sep 14 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 26 16:33 EDT 2019. Contains 321510 sequences. (Running on oeis4.)