login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation (tax deductible in USA) to keep the OEIS running. Over 5000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A057275 Triangle T(n,k) of number of unilaterally connected digraphs on n labeled nodes and with k arcs, k=0,1,..,n*(n-1). 2
1, 0, 2, 1, 0, 0, 6, 20, 15, 6, 1, 0, 0, 0, 24, 222, 660, 908, 792, 495, 220, 66, 12, 1, 0, 0, 0, 0, 120, 2304, 15540, 52700, 109545, 161120, 182946, 167660, 125945, 77520, 38760, 15504, 4845, 1140, 190, 20, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,3

LINKS

Table of n, a(n) for n=1..45.

EXAMPLE

[1],[0,2,1],[0,0,6,20,15,6,1],[0,0,0,0,24,222,660,908,792,495,220,66,12,1],...; Number of unilaterally connected digraphs on 3 labeled nodes is 48=6+20+15+6+1.

CROSSREFS

Row sums give A003029. Cf. A057270-A057274, A057276-A057279.

Sequence in context: A262125 A105868 A267163 * A057271 A021480 A201299

Adjacent sequences:  A057272 A057273 A057274 * A057276 A057277 A057278

KEYWORD

nonn,tabf

AUTHOR

Vladeta Jovovic, Goran Kilibarda, Sep 14 2000

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified December 9 06:36 EST 2016. Contains 278963 sequences.