id:A005037 - OEIS Search Results

Search: id:A005037

Displaying 1-1 of 1 results found.

page 1

Number of ways of dissecting a polygon into n pentagons.
(Formerly M4236)

+0
1

1, 1, 6, 40, 285, 2126, 16380, 129456, 1043460, 8544965, 70893054, 594610536, 5033644070, 42952562100, 369061673400, 3190379997272, 27727712947836 (list; graph; listen)

	OFFSET	`1,3`
	REFERENCES	`F. Harary, E. M. Palmer and R. C. Read, On the cell-growth problem for arbitrary polygons, Discr. Math. 11 (1975), 371-389.`
	CROSSREFS	`Sequence in context: A122471 A090041 A069720 this_sequence A081337 A138240 A083805` `Adjacent sequences: A005034 A005035 A005036 this_sequence A005038 A005039 A005040`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.

AT&T Labs Research