Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A098724
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A098724 a(n) = C(n, 5)^(n-6) +0
11
1, 1, 21, 3136, 2000376, 4032758016, 21047953604832, 246803372284575744, 5848571832825267643383, 258055182353934343170048256, 19860857243854539712080765166683, 2528286565488663166137820705009434624 (list; graph; listen)
OFFSET

5,3

COMMENT

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 5-arch graphs on n nodes. The correct sequence is given in our paper.

REFERENCES

B. Leclerc, Graphes d'arches, Math. Sci. Hum. 157 (2002), 27-48.

LINKS

C. Lamathe, The number of labeled k-arch graphs.

Saverio Caminiti and Emanuele G. Fusco, On the Number of Labeled k-arch Graphs, Journal of Integer Sequences, Vol 10 (2007), Article 07.7.5

C. Lamathe, The number of labeled k-arch graphs, Journal of Integer Sequences, Vol. 7 (2004), Article 04.3.1.

MAPLE

with(combinat); seq( binomial(n, 5)^(n-6), n=5..19 );

CROSSREFS

Cf. A098721, A098722, A098723

Sequence in context: A098375 A095154 A018238 this_sequence A078395 A153833 A055416

Adjacent sequences: A098721 A098722 A098723 this_sequence A098725 A098726 A098727

KEYWORD

easy,nonn

AUTHOR

Cedric Lamathe (lamathe(AT)loria.fr), Sep 30 2004

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 25 08:46 EST 2009. Contains 167481 sequences.


AT&T Labs Research