Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A057275
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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). +0
3
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; listen)
OFFSET

1,3

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: A065080 A057150 A105868 this_sequence A057271 A021480 A057274

Adjacent sequences: A057272 A057273 A057274 this_sequence A057276 A057277 A057278

KEYWORD

nonn,tabf

AUTHOR

Vladeta Jovovic, Goran Kilibarda (vladeta(AT)Eunet.yu), Sep 14 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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research