id:A001763 - OEIS Search Results

Search: id:A001763

Displaying 1-1 of 1 results found.

page 1

Number of dissections of a ball: (3n+3)!/(2n+3)!.
(Formerly M4279 N1788)

+0
5

1, 1, 6, 72, 1320, 32760, 1028160, 39070080, 1744364160, 89513424000, 5191778592000, 335885501952000, 23982224839372800, 1873278229119897600, 158905670470170624000, 14547557832075620352000 (list; graph; listen)

	OFFSET	`-1,3`
	REFERENCES	`L. W. Beineke and R. E. Pippert, Enumerating labeled k-dimensional trees and ball dissections, pp. 12-26 of Proceedings of Second Chapel Hill Conference on Combinatorial Mathematics and Its Applications, University of North Carolina, Chapel Hill, 1970. Reprinted in Math. Annalen, 191 (1971), 87-98.`
	LINKS	`INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 407`
	CROSSREFS	`Cf. A001762.` `Sequence in context: A052719 A063965 A047058 this_sequence A003235 A113133 A089252` `Adjacent sequences: A001760 A001761 A001762 this_sequence A001764 A001765 A001766`
	KEYWORD	`nonn`
	AUTHOR	`njas. Simon Plouffe (plouffe(AT)math.uqam.ca)`

page 1

Search completed in 0.002 seconds

Last modified July 23 17:35 EDT 2008. Contains 142285 sequences.

AT&T Labs Research