login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A108507 Number of paths of length n between two arbitrary, distinct vertices in K5, the complete graph on 5 vertices. 1
1, 3, 6, 18, 48, 78, 96, 132, 132 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

For K4 the sequence is 1, 2, 2, 4, 6.

LINKS

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

Eric Weisstein. "Complete Graph."

EXAMPLE

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

CROSSREFS

Cf. A108506, A108508, A108509.

Sequence in context: A148557 A148558 A148559 * A287212 A083337 A019308

Adjacent sequences:  A108504 A108505 A108506 * A108508 A108509 A108510

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 14 12:21 EST 2019. Contains 329114 sequences. (Running on oeis4.)