The On-Line Encyclopedia of Integer Sequences (OEIS)

The OEIS is supported by the many generous donors to the OEIS Foundation.

Revision History for A134958

(Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

Number of hypertrees with n labeled vertices: analog of A030019 when edges of size 1 are allowed (with no two equal edges).
(history; published version)

#6 by Alois P. Heinz at Wed Aug 21 17:57:08 EDT 2019

STATUS

editing

approved

#5 by Alois P. Heinz at Wed Aug 21 17:57:06 EDT 2019

LINKS

Alois P. Heinz, <a href="/A134958/b134958.txt">Table of n, a(n) for n = 0..338</a>

#4 by Alois P. Heinz at Wed Aug 21 17:56:48 EDT 2019

MAPLE

a:= n-> 2^n*`if`(n=0, 1, add(Stirling2(n-1, i)*n^(i-1), i=0...n-1)):

seq(a(n), n=0..18); # Alois P. Heinz, Aug 21 2019

STATUS

approved

editing

#3 by Jon E. Schoenfield at Fri Jul 10 20:00:16 EDT 2015

STATUS

editing

approved

#2 by Jon E. Schoenfield at Fri Jul 10 20:00:13 EDT 2015

NAME

Number of hypertrees with n labeled vertices: analogue analog of A030019 when edges of size 1 are allowed (with no two equal edges).

AUTHOR

D. E. _Don Knuth, _, Jan 26 2008

STATUS

approved

editing

#1 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008

NAME

Number of hypertrees with n labeled vertices: analogue of A030019 when edges of size 1 are allowed (with no two equal edges).

DATA

1, 2, 4, 32, 464, 9952, 284608, 10207360, 441006336, 22312355840, 1294525492224, 84749726259200, 6181332806029312, 497099907500220416, 43702202601439608832, 4169993748235341529088, 429217455330896263577600, 47406138617171801211797504

OFFSET

0,2

FORMULA

Equals 2^n*A030019(n).

KEYWORD

nonn

AUTHOR

D. E. Knuth, Jan 26 2008

STATUS

approved