id:A108509 - OEIS Search Results

Search: id:A108509

Displaying 1-1 of 1 results found.

page 1

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

+0
3

1, 5, 20, 100, 480, 1980, 7680, 29040, 100920, 316320, 923520, 2502000, 6011760, 12584880, 23417280, 38196480, 50112000, 53667840, 64988160, 64988160 (list; graph; listen)

	OFFSET	`1,2`
	LINKS	`Eric Weisstein. "Complete Graph."`
	EXAMPLE	`a(5) = 480 because there are 480 paths of length 5 between two arbitrary, distinct vertices in K7.`
	CROSSREFS	`Cf. A108506-A108508.` `Adjacent sequences: A108506 A108507 A108508 this_sequence A108510 A108511 A108512` `Sequence in context: A002745 A020046 A026118 this_sequence A110595 A092640 A109500`
	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 October 6 12:54 EDT 2008. Contains 144667 sequences.

AT&T Labs Research