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!)
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
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
Sequence in context: A319731 A272218 A026118 * A110595 A369488 A092640
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 | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified February 29 21:35 EST 2024. Contains 370428 sequences. (Running on oeis4.)