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

1, 4, 12, 48, 180, 528, 1392, 3600, 7920, 13680, 21840, 31872, 25008

Offset: 1

Author

Ryan Propper, Jun 06 2005

Keywords

• easy
• fini
• full
• nonn

Examples

			a(5) = 180 because there are 180 paths of length 5 between two arbitrary, distinct vertices in K6.
		

Links

• Eric Weisstein's World of Mathematics, Complete Graph.

Crossrefs

Cf. A108506, A108507, A108509.