

A108509


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


2



1, 5, 20, 100, 480, 1980, 7680, 29040, 100920, 316320, 923520, 2502000, 6011760, 12584880, 23417280, 38196480, 50112000, 53667840, 64988160, 64988160
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


LINKS



EXAMPLE

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


CROSSREFS



KEYWORD

easy,fini,full,nonn


AUTHOR



STATUS

approved



