

A108507


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


1




OFFSET

1,2


COMMENTS

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


LINKS

Table of n, a(n) for n=1..9.
Eric Weisstein. "Complete Graph."


EXAMPLE

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


CROSSREFS

Cf. A108506, A108508, A108509.
Sequence in context: A148557 A148558 A148559 * A287212 A083337 A019308
Adjacent sequences: A108504 A108505 A108506 * A108508 A108509 A108510


KEYWORD

easy,fini,full,nonn


AUTHOR

Ryan Propper, Jun 06 2005


STATUS

approved



