|
| |
|
|
A108508
|
|
Number of paths of length n between two arbitrary, distinct vertices in K6, the complete graph on 6 vertices.
|
|
2
|
|
|
|
1, 4, 12, 48, 180, 528, 1392, 3600, 7920, 13680, 21840, 31872, 25008
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
a(5) = 180 because there are 180 paths of length 5 between two arbitrary, distinct vertices in K6.
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
easy,fini,full,nonn
|
|
|
AUTHOR
|
|
|
|
STATUS
|
approved
|
| |
|
|
