Number of paths of length n between two arbitrary, distinct vertices in K6, the complete graph on 6 vertices.
A108508
Number of paths of length n between two arbitrary, distinct vertices in K6, the complete graph on 6 vertices.
Terms
- a(0) =1a(1) =4a(2) =12a(3) =48a(4) =180a(5) =528a(6) =1392a(7) =3600a(8) =7920a(9) =13680a(10) =21840a(11) =31872a(12) =25008
External references
- oeis: A108508