|
%I #7 Mar 01 2023 11:41:30
%S 1,4,12,48,180,528,1392,3600,7920,13680,21840,31872,25008
%N Number of paths of length n between two arbitrary, distinct vertices in K6, the complete graph on 6 vertices.
%H Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CompleteGraph.html">Complete Graph</a>.
%e a(5) = 180 because there are 180 paths of length 5 between two arbitrary, distinct vertices in K6.
%Y Cf. A108506, A108507, A108509.
%K easy,fini,full,nonn
%O 1,2
%A _Ryan Propper_, Jun 06 2005
|
