BBC Russian

Revision History for A213442

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

A213442

Number of 3-colored graphs on n labeled nodes.
(history; published version)

#23 by Joerg Arndt at Sat Dec 01 04:49:27 EST 2018

STATUS

proposed

approved

#22 by Michel Marcus at Sat Dec 01 01:05:06 EST 2018

STATUS

editing

proposed

#21 by Michel Marcus at Sat Dec 01 01:05:02 EST 2018

LINKS

R. C. Read, <a href="httphttps://cms.mathdoi.ca/cjmorg/v1210.4153/CJM-1960-035-0">The number of k-colored graphs on labelled nodes</a>, Canad. J. Math., 12 (1960), 410—414.

R. P. Stanley, <a href="httphttps://www-math.mitdoi.edu/~rstan/pubs/pubfilesorg/1810.pdf1016/0012-365X(73)90108-8">Acyclic orientation of graphs</a>, Discrete Math. 5 (1973), 171-178. North Holland Publishing Company.

STATUS

proposed

editing

#20 by Andrew Howroyd at Fri Nov 30 23:30:45 EST 2018

STATUS

editing

proposed

#19 by Andrew Howroyd at Fri Nov 30 23:08:54 EST 2018

PROG

(PARI) seq(n)={Vec(serconvol(sum(j=1, n, x^j*j!*2^binomial(j, 2)) + O(x*x^n), (sum(j=1, n, x^j/(j!*2^binomial(j, 2))) + O(x*x^n))^3), -n)} \\ Andrew Howroyd, Nov 30 2018

STATUS

approved

editing

#18 by Alois P. Heinz at Thu Mar 06 04:20:25 EST 2014

STATUS

editing

approved

#17 by Alois P. Heinz at Thu Mar 06 04:20:20 EST 2014

LINKS

R. P. Stanley, <a href="http://www-math.mit.edu/~rstan/pubs/pubfiles/18.pdf">Acyclic orientation of graphs</a> , Discrete Math. 5 (1973), 171-178. North Holland Publishing Company.

STATUS

approved

editing

#16 by Alois P. Heinz at Tue Jul 23 11:15:08 EDT 2013

STATUS

editing

approved

#15 by Alois P. Heinz at Tue Jul 23 11:15:01 EDT 2013

LINKS

Alois P. Heinz, <a href="/A213442/b213442.txt">Table of n, a(n) for n = 1..75</a>

CROSSREFS

Cf. A191371, A213441, A224068.

#14 by Alois P. Heinz at Tue Jul 23 11:14:28 EDT 2013

LINKS

Alois P. Heinz, <a href="/A213442/b213442.txt">Table of n, a(n) for n = 1..75</a>

STATUS

proposed

editing