# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/

Search: id:a108509
Showing 1-1 of 1

%I A108509 #7 Mar 01 2023 11:41:45
%S A108509 1,5,20,100,480,1980,7680,29040,100920,316320,923520,2502000,6011760,
%T A108509 12584880,23417280,38196480,50112000,53667840,64988160,64988160
%N A108509 Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.
%H A108509 Eric Weisstein's World of Mathematics, <a href="http://mathworld.wolfram.com/CompleteGraph.html">Complete Graph</a>.
%e A108509 a(5) = 480 because there are 480 paths of length 5 between two arbitrary, distinct vertices in K7.
%Y A108509 Cf. A108506, A108507, A108508.
%K A108509 easy,fini,full,nonn
%O A108509 1,2
%A A108509 _Ryan Propper_, Jun 06 2005

# Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE