login
This site is supported by donations 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
1, 4, 12, 48, 180, 528, 1392, 3600, 7920, 13680, 21840, 31872, 25008 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..13.

Eric Weisstein. "Complete Graph."

EXAMPLE

a(5) = 180 because there are 180 paths of length 5 between two arbitrary, distinct vertices in K6.

CROSSREFS

Cf. A108506, A108507, A108509.

Sequence in context: A149382 A149383 A149384 * A019309 A056632 A149385

Adjacent sequences:  A108505 A108506 A108507 * A108509 A108510 A108511

KEYWORD

easy,fini,full,nonn

AUTHOR

Ryan Propper, Jun 06 2005

STATUS

approved

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

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 21 22:35 EST 2019. Contains 329383 sequences. (Running on oeis4.)