id:A152684 - OEIS Search Results

Search: id:A152684

Displaying 1-1 of 1 results found.

page 1

a(n) is the number of top-down sequences (F_1,F_2, ..., F_n) whereas each F_i is a labeled forest on n nodes, containing i directed rooted trees. F_(i+1) is proper subset of F_i.

+0
1

1, 2, 18, 384, 15000, 933120, 84707280, 10569646080, 1735643790720, 362880000000000, 94121726392108800, 29658516531078758400 (list; graph; listen)

	OFFSET	`1,2`
	FORMULA	`a(n)=n^(n-2)*(n!)`
	EXAMPLE	`a(1)=1^(1-2)(1!)=1` `a(2)=2^(2-2)(2!)=2` `a(3)=3^(3-2)*(3!)=18`
	CROSSREFS	`Sequence in context: A090307 A123311 A132911 this_sequence A141074 A082402 A156907` `Adjacent sequences: A152681 A152682 A152683 this_sequence A152685 A152686 A152687`
	KEYWORD	`nonn`
	AUTHOR	`Fabian Nedic (fabian.nedic(AT)gmx.de), Dec 10 2008`

page 1

Search completed in 0.002 seconds

Last modified December 18 21:37 EST 2009. Contains 171024 sequences.

AT&T Labs Research