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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A138387 Numbers of unlabeled graphs with n vertices and 2 unicyclic components. 1
1, 2, 8, 23, 74, 220, 674, 2011, 6038, 17980, 53547, 158907, 471225, 1394786, 4124929, 12185636, 35972082, 106111713, 312835608, 921809509, 2715058701, 7993741597, 23527694230, 69228383367, 203648980297, 598945442071 (list; graph; refs; listen; history; internal format)
OFFSET

6,2

COMMENTS

This sequence is the second row of table T of A137918.

FORMULA

For n odd, a(n) = Sum(3 <= i <= (n-1)/2){f(i) * f(n-i)}; for n even, a(n) = Sum(3 <= i <= n/2 - 1){f(i) * f(n-i)} + (f(n/2)+1)*f(n/2)/2, where f(k) is A001429(k).

EXAMPLE

a(13) = 2,011, since n is odd and the partitions are 3+10, 4+9, 5+8 and 6+7. This gives 657 + 480 + 445 + 429 graphs.

Note that f(4)= 2, f(5) = 5, f(6) = 13, f(7) = 33, f(8) = 89, f(9) = 240 and f(10) = 657.

CROSSREFS

Cf. A001429, A137918.

Sequence in context: A180664 A018042 A072842 * A007346 A062247 A171261

Adjacent sequences:  A138384 A138385 A138386 * A138388 A138389 A138390

KEYWORD

easy,nonn

AUTHOR

Washington G. Bomfim (webonfim(AT)bol.com.br), Mar 18 2008

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 08:13 EST 2012. Contains 205893 sequences.