The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons 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 56th year, we are closing in on 350,000 sequences, and we’ve crossed 9,700 citations (which often say “discovered thanks to the OEIS”).

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A201968 Limiting number of graphs with m+n nodes and m connected components as m tends to infinity. 1
 1, 1, 3, 9, 33, 157, 1077, 12562, 276361, 12023304, 1019341931, 165104554019, 50503104222056, 29054325051128443, 31426537149908636858, 64001044963441537716700, 245935895697060179316310623, 1787577789272803153324620542087, 24637809499317378365431171138790458 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 LINKS FORMULA Limit of A201922(m+n,m) as m tends to infinity. a(n) = A201922(2*n,n) = A201922(2*n+1,n+1) = ... a(n) = sum over the partitions of n of Product_{i=1..n} binomial(A001349(i+1)+Ki-1, Ki), where Ki is the number of parts equal to i, 1*K1 + 2*K2 + ... + n*Kn = n. CROSSREFS Sequence in context: A294035 A007489 A294638 * A264237 A097677 A138769 Adjacent sequences:  A201965 A201966 A201967 * A201969 A201970 A201971 KEYWORD nonn AUTHOR Max Alekseyev, Dec 07 2011 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.

Last modified December 7 13:08 EST 2021. Contains 349581 sequences. (Running on oeis4.)