

A108507


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


2




OFFSET

1,2


COMMENTS

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


LINKS



EXAMPLE

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


CROSSREFS



KEYWORD

easy,fini,full,nonn


AUTHOR



STATUS

approved



