Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A002499
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A002499 Number of self-converse digraphs with n nodes.
(Formerly M2875 N1156)
+0
6
1, 3, 10, 70, 708, 15224, 544152, 39576432, 5074417616, 1296033011648, 604178966756320, 556052774253161600, 954895322019762585664, 3224152068625567826724224, 20610090531322819956330186112 (list; graph; listen)
OFFSET

1,2

REFERENCES

F. Harary and E. M. Palmer, Enumeration of self-converse digraphs, Mathematika, 13 (1966), 151-157.

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 155, Table 6.6.1 (but the last entry is wrong).

R. W. Robinson, personal communication.

R. W. Robinson, Numerical implementation of graph counting algorithms, AGRC Grant, Math. Dept., Univ. Newcastle, Australia, 1980.

LINKS

R. W. Robinson, Table of n, a(n) for n = 1..28

CROSSREFS

Cf. A002500.

Sequence in context: A004102 A072638 A080526 this_sequence A047833 A047834 A136507

Adjacent sequences: A002496 A002497 A002498 this_sequence A002500 A002501 A002502

KEYWORD

nonn,nice

AUTHOR

njas

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Apr 17 2000

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research