id:A108508 - OEIS Search Results

Search: id:A108508

Displaying 1-1 of 1 results found.

page 1

Number of paths of length n between two arbitrary, distinct vertices in K6, the complete graph on 6 vertices.

+0
3

1, 4, 12, 48, 180, 528, 1392, 3600, 7920, 13680, 21840, 31872, 25008 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Eric Weisstein. "Complete Graph."`
	EXAMPLE	`a(5) = 180 because there are 180 paths of length 5 between two arbitrary, distinct vertices in K6.`
	CROSSREFS	`Cf. A108506, A108507, A108509.` `Sequence in context: A057346 A081620 A063887 this_sequence A019309 A056632 A092898` `Adjacent sequences: A108505 A108506 A108507 this_sequence A108509 A108510 A108511`
	KEYWORD	`easy,fini,full,nonn`
	AUTHOR	`Ryan Propper (rpropper(AT)stanford.edu), Jun 06 2005`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.