Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A003025
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A003025 Number of n-node labeled acyclic digraphs with 1 out-point.
(Formerly M2083)
+0
7
1, 2, 15, 316, 16885, 2174586, 654313415, 450179768312, 696979588034313, 2398044825254021110, 18151895792052235541515, 299782788128536523836784628, 10727139906233315197412684689421 (list; graph; listen)
OFFSET

1,2

REFERENCES

R. W. Robinson, Counting labeled acyclic digraphs, pp. 239-273 of F. Harary, editor, New Directions in the Theory of Graphs. Academic Press, NY, 1973.

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

EXAMPLE

a(2) = 2: o-->--o (2 ways)

a(3) = 15: o-->--o-->--o (6 ways) and

o ... o o-->--o

.\ . / . \ . /

. v v ... v v

.. o ..... o

(3 ways) (6 ways)

CROSSREFS

Cf. A058876, A003026.

Sequence in context: A076111 A087526 A059167 this_sequence A015200 A030642 A068391

Adjacent sequences: A003022 A003023 A003024 this_sequence A003026 A003027 A003028

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

More terms from Vladeta Jovovic (vladeta(AT)eunet.rs), Apr 10 2001

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 23 17:09 EST 2009. Contains 167438 sequences.


AT&T Labs Research