id:A006236 - OEIS Search Results

Search: id:A006236

Displaying 1-1 of 1 results found.

page 1

n^n-2 (n+2)^n-1.
(Formerly M3698)

+0
1

1, 4, 75, 3456, 300125, 42467328, 8931928887, 2621440000000, 1025271882697689, 515978035200000000, 325063112540091870659, 250738401558910243700736 (list; graph; listen)

	OFFSET	`1,2`
	REFERENCES	`G. Kreweras, Complexite et circuits Euleriens dans la sommes tensorielles de graphes, J. Combin. Theory, B 24 (1978), 202-212.`
	CROSSREFS	`Sequence in context: A072373 A006412 A137220 this_sequence A120248 A100323 A067921` `Adjacent sequences: A006233 A006234 A006235 this_sequence A006237 A006238 A006239`
	KEYWORD	`nonn`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.

AT&T Labs Research