|
|
A098722
|
|
a(n) = C(n, 3)^(n-4).
|
|
3
|
|
|
1, 1, 10, 400, 42875, 9834496, 4182119424, 2985984000000, 3329565857578125, 5487587353600000000, 12802485663117464444416, 40833239547181264169598976, 173031575921620011303271484375, 951166013805414055936000000000000
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
3,3
|
|
COMMENTS
|
Comment from Saverio Caminiti and Emanuele G. Fusco (fusco(AT)di.uniroma1.it), Sep 18 2007: There is a flaw in the paper by Lamathe that we point out in our contribution. This sequence does not give the number of labeled 3-arch graphs on n nodes. The correct sequence is given in our paper.
|
|
LINKS
|
|
|
MAPLE
|
with(combinat); seq( binomial(n, 3)^(n-4), n=3..19 );
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
Cedric Lamathe (lamathe(AT)loria.fr), Sep 30 2004
|
|
STATUS
|
approved
|
|
|
|