A108507 Number of paths of length n between two arbitrary, distinct vertices in K5, the complete graph on 5 vertices.

1, 3, 6, 18, 48, 78, 96, 132, 132

Offset: 1

Author

Ryan Propper, Jun 06 2005

Keywords

• easy
• fini
• full
• nonn

Comments

For K4 the sequence is 1, 2, 2, 4, 6.

Examples

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

Links

• Eric Weisstein. "Complete Graph."

Crossrefs

Cf. A108506, A108508, A108509.