login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108508 Number of paths of length n between two arbitrary, distinct vertices in K6, the complete graph on 6 vertices. 2

%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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 3 08:35 EST 2024. Contains 370499 sequences. (Running on oeis4.)