The On-Line Encyclopedia of Integer Sequences (OEIS)

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

A209327

Total number of nodes in the largest connected component of a functional digraph summed over all endofunctions f:{1,2,...,n}-> {1,2,...,n}.
(history; published version)

#27 by Alois P. Heinz at Sun Dec 19 08:02:26 EST 2021

STATUS

editing

approved

#26 by Alois P. Heinz at Sun Dec 19 08:02:06 EST 2021

MAPLE

b:= proc(n, i, m) option remember; `if`(n=0, x^m, `if`(i<1, 0, add(g(i)^j*

b(n-i*j, i-1, , max(m, i$j))/j!*multinomialbinomial(n, n-1, i*j, -1), i$j), j=01..n/i)))

a:= n-> (p-> add(coeff(p, x, i)*i, i=1..n))(b(n$2, , 0)):

STATUS

approved

editing

Discussion

Sun Dec 19

08:02

Alois P. Heinz: shortened ...

#25 by Alois P. Heinz at Fri Dec 17 11:24:01 EST 2021

STATUS

editing

approved

#24 by Alois P. Heinz at Fri Dec 17 09:40:22 EST 2021

CROSSREFS

Cf. A001865, A209324, A350157.

STATUS

approved

editing

#23 by Alois P. Heinz at Fri Dec 17 09:30:52 EST 2021

STATUS

editing

approved

#22 by Alois P. Heinz at Fri Dec 17 09:30:49 EST 2021

CROSSREFS

Cf. A001865, A209324.

STATUS

approved

editing

#21 by Alois P. Heinz at Fri Dec 17 09:29:20 EST 2021

STATUS

editing

approved

#20 by Alois P. Heinz at Fri Dec 17 09:29:17 EST 2021

CROSSREFS

Cf. A209324.

STATUS

approved

editing

#19 by Alois P. Heinz at Fri Dec 17 09:28:25 EST 2021

STATUS

editing

approved

#18 by Alois P. Heinz at Fri Dec 17 09:28:21 EST 2021

LINKS

Alois P. Heinz, <a href="/A209327/b209327.txt">Table of n, a(n) for n = 1..385</a>