[go: up one dir, main page]

login
Revision History for A034799 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing entries 1-10 | older changes
Triangle read by rows: T(n,k) is the number of partially labeled trees with n nodes, k of which are labeled, 0 <= k <= n.
(history; published version)
#18 by Alois P. Heinz at Thu Mar 23 19:28:23 EDT 2023
STATUS

proposed

approved

#17 by Andrew Howroyd at Thu Mar 23 18:40:27 EDT 2023
STATUS

editing

proposed

#16 by Andrew Howroyd at Thu Mar 23 18:38:58 EDT 2023
NAME

Triangle of read by rows: T(n,k) is the number of partially labeled trees by number of with n nodes and number , k of labelswhich are labeled, 0 <= k <= n.

AUTHOR
EXTENSIONS

Name edited by Andrew Howroyd, Mar 23 2023

STATUS

proposed

editing

Discussion
Thu Mar 23
18:40
Andrew Howroyd: Names of column sequences are much clearer. I have edited name accordingly.
#15 by Robert A. Russell at Thu Mar 23 16:40:27 EDT 2023
STATUS

editing

proposed

#14 by Robert A. Russell at Thu Mar 23 16:40:20 EDT 2023
STATUS

approved

editing

#13 by Michel Marcus at Sat Sep 05 02:57:26 EDT 2020
STATUS

reviewed

approved

#12 by Joerg Arndt at Sat Sep 05 02:46:58 EDT 2020
STATUS

proposed

reviewed

#11 by Sean A. Irvine at Fri Sep 04 19:34:35 EDT 2020
STATUS

editing

proposed

#10 by Sean A. Irvine at Fri Sep 04 19:34:22 EDT 2020
EXAMPLE

Triangle begins:

1;

1, 1;

1, 1, 1;

1, 2, 3, 3;

2, 4, 9, 16, 16;

...

STATUS

proposed

editing

#9 by Sean A. Irvine at Fri Sep 04 19:28:07 EDT 2020
STATUS

editing

proposed