The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A057279 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A057279

Triangle T(n,k) of number of digraphs with a quasi-source on n unlabeled nodes and with k arcs, k = 0..n*(n-1).
(history; published version)

#15 by Peter Luschny at Mon May 30 18:03:18 EDT 2022

STATUS

proposed

approved

#14 by Jon E. Schoenfield at Mon May 30 17:26:34 EDT 2022

STATUS

editing

proposed

#13 by Jon E. Schoenfield at Mon May 30 17:26:30 EDT 2022

NAME

Triangle T(n,k) of number of digraphs with a quasi-source on n unlabeled nodes and with k arcs, k = 0,1,..,n*(n-1).

STATUS

proposed

editing

#12 by Sean A. Irvine at Mon May 30 17:04:14 EDT 2022

STATUS

editing

proposed

#11 by Sean A. Irvine at Mon May 30 17:04:08 EDT 2022

LINKS

Sean A. Irvine, <a href="https://github.com/archmageirvine/joeis/blob/master/src/irvine/oeis/a234/A234007.java">Java program</a> (github)

#10 by Sean A. Irvine at Mon May 30 17:02:12 EDT 2022

DATA

1, 0, 1, 1, 0, 0, 3, 4, 4, 1, 1, 0, 0, 0, 7, 21, 37, 47, 38, 27, 13, 5, 1, 1, 0, 0, 0, 0, 18, 90, 309, 661, 1125, 1477, 1665, 1489, 1154, 707, 379, 154, 61, 16, 5, 1, 1, 0, 0, 0, 0, 0, 44, 374, 1981, 7107, 19166, 41867, 77194, 122918, 170308, 206980, 220768, 207301, 171008, 124110, 78813, 43862, 21209, 8951, 3242, 1043, 288, 76, 17, 5, 1, 1

KEYWORD

more,nonn,tabf

EXTENSIONS

More terms from Sean A. Irvine, May 30 2022

STATUS

approved

editing

#9 by Bruno Berselli at Thu Feb 05 05:57:42 EST 2015

STATUS

proposed

approved

#8 by Michel Marcus at Thu Feb 05 05:41:01 EST 2015

STATUS

editing

proposed

#7 by Michel Marcus at Thu Feb 05 05:40:56 EST 2015

REFERENCES

V. Jovovic, G. Kilibarda, Enumeration of labeled quasi-initially connected digraphs, Discrete Math., 224 (2000), 151-163.

LINKS

V. Jovovic and G. Kilibarda, <a href="http://dx.doi.org/10.1016/S0012-365X(00)00112-6">Enumeration of labeled quasi-initially connected digraphs</a>, Discrete Math., 224 (2000), 151-163.

EXAMPLE

Table starts:

[1],

[0,1,1],

[0,0,3,4,4,1,1],

[0,0,0,7,21,37,47,38,27,13,5,1,1],

...

[1],[0,1,1],[0,0,3,4,4,1,1],[0,0,0,7,21,37,47,38,27,13,5,1,1],...; Number of digraphs with a quasi-source on 3 unlabeled nodes is 13=3+4+4+1+1.

STATUS

approved

editing

#6 by R. J. Mathar at Fri Jun 14 03:57:57 EDT 2013

STATUS

editing

approved