Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003088
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003088 Number of unilateral digraphs with n unlabeled nodes.
(Formerly M2011)
+0
5
1, 1, 2, 11, 171, 8603, 1478644 (list; graph; listen)
OFFSET

0,3

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

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

R. C. Read (rcread(AT)math.uwaterloo.ca), email to N. J. A. Sloane (njas(AT)research.att.com), 28 August, 2000.

R. C. Read and R. J. Wilson, An Atlas of Graphs, Oxford, 1998.

R. W. Robinson, Counting strong digraphs (research announcement), J. Graph Theory 1, 1977, pp. 189-190.

CROSSREFS

Cf. A057270, A003029 (labeled case), A003085, A035512, A051421, A049531, A049512.

Sequence in context: A013050 A051255 A120445 this_sequence A121231 A122527 A039747

Adjacent sequences: A003085 A003086 A003087 this_sequence A003089 A003090 A003091

KEYWORD

nonn,nice,more

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

Note that Read and Wilson incorrectly give a(4) as 172 - thanks to Vladeta Jovovic, Goran Kilibarda (vladeta(AT)eunet.rs) for finding this error and for verifying a(5).

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 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research