|
Search: id:A003408
|
|
|
| A003408 |
|
C(3n+6,n).
(Formerly M4643)
|
|
+0
4
|
|
| 1, 9, 66, 455, 3060, 20349, 134596, 888030, 5852925, 38567100, 254186856, 1676056044, 11058116888, 73006209045, 482320623240, 3188675231420, 21094923659355, 139646485582065, 925029565741050, 6131164307078475
(list; graph; listen)
|
|
|
OFFSET
|
0,2
|
|
|
COMMENT
|
Number of connected graphs without crossing edges on n+3 nodes on a circle and having exactly 1 interior face. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Nov 06 2001
|
|
REFERENCES
|
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
C. Domb and A. J. Barrett, Enumeration of ladder graphs, Discrete Math. 9 (1974), 341-358.
|
|
LINKS
|
Milan Janjic, Two Enumerative Functions
|
|
EXAMPLE
|
a(0)=1 because among the 4 non-crossing connected graphs on 3 nodes on a circle only the triangle has exactly 1 interior face.
|
|
MAPLE
|
a:=n->sum(binomial(2*n-2, n+j)*binomial(n-1, n-j), j=0..n): seq(a(n), n=3..22); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jan 29 2007
|
|
CROSSREFS
|
Sequence in context: A051375 A081902 A002695 this_sequence A037698 A037607 A055148
Adjacent sequences: A003405 A003406 A003407 this_sequence A003409 A003410 A003411
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Simon Plouffe (simon.plouffe(AT)gmail.com)
|
|
EXTENSIONS
|
Formula found by Simon Plouffe (simon.plouffe(AT)gmail.com)
More terms from James A. Sellers (sellersj(AT)math.psu.edu), Aug 21 2000
|
|
|
Search completed in 0.002 seconds
|
