|
%I #3 Oct 02 2013 15:12:46
%S 1,3,6,18,48,78,96,132,132
%N Number of paths of length n between two arbitrary, distinct vertices in K5, the complete graph on 5 vertices.
%C For K4 the sequence is 1, 2, 2, 4, 6.
%H Eric Weisstein. <a href="http://mathworld.wolfram.com/CompleteGraph.html">"Complete Graph."</a>
%e a(5) = 48 because there are 48 paths of length 5 between two arbitrary, distinct vertices in K5.
%Y Cf. A108506, A108508, A108509.
%K easy,fini,full,nonn
%O 1,2
%A _Ryan Propper_, Jun 06 2005
|
