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,2

Links

Table of n, a(n) for n=1..13.

Eric Weisstein's World of Mathematics, 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: A149382 A149383 A149384 * A019309 A056632 A149385

Adjacent sequences: A108505 A108506 A108507 * A108509 A108510 A108511

Keyword

easy,fini,full,nonn

Author

Ryan Propper, Jun 06 2005

Status

approved