Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051504
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A051504 Number of asymmetric digraphs with n nodes. +0
3
1, 1, 1, 7, 136, 8001, 1445297 (list; graph; listen)
OFFSET

0,4

REFERENCES

F. Harary and E. M. Palmer, Graphical Enumeration, Academic Press, NY, 1973, p. 231.

P. K. Stockmeyer, The enumeration of graphs with prescribed automorphism group, Dissertation, Univ. of Michigan, Ann Arbor, 1971.

CROSSREFS

Cf. A000273 (digraphs), A003400 (asymmetric graphs), A030242 (asymmetric relations)

Sequence in context: A001533 A143181 A081793 this_sequence A058881 A100520 A009701

Adjacent sequences: A051501 A051502 A051503 this_sequence A051505 A051506 A051507

KEYWORD

hard,nonn,nice

AUTHOR

Vladeta Jovovic (vladeta(AT)eunet.rs)

EXTENSIONS

a(6) from Christian G. Bower (bowerc(AT)usa.net) Dec 15 1999.

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 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research