A108509 - OEIS

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

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A108509

Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.

2

1, 5, 20, 100, 480, 1980, 7680, 29040, 100920, 316320, 923520, 2502000, 6011760, 12584880, 23417280, 38196480, 50112000, 53667840, 64988160, 64988160

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

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

Eric Weisstein's World of Mathematics, Complete Graph.

EXAMPLE

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

CROSSREFS

Cf. A108506, A108507, A108508.

Sequence in context: A372006 A272218 A026118 * A110595 A369488 A092640

Adjacent sequences: A108506 A108507 A108508 * A108510 A108511 A108512

KEYWORD

easy,fini,full,nonn

AUTHOR

Ryan Propper, Jun 06 2005

STATUS

approved