The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A108509 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing all changes.

A108509

Number of paths of length n between two arbitrary, distinct vertices in K7, the complete graph on 7 vertices.
(history; published version)

#7 by Amiram Eldar at Wed Mar 01 11:41:45 EST 2023

STATUS

reviewed

approved

#6 by Joerg Arndt at Wed Mar 01 11:12:49 EST 2023

STATUS

proposed

reviewed

#5 by Michel Marcus at Wed Mar 01 11:09:51 EST 2023

STATUS

editing

proposed

#4 by Michel Marcus at Wed Mar 01 11:09:32 EST 2023

LINKS

Eric Weisstein. 's World of Mathematics, <a href="http://mathworld.wolfram.com/CompleteGraph.html">"Complete Graph."</a>.

CROSSREFS

Cf. A108506-, A108507, A108508.

STATUS

approved

editing

#3 by Charles R Greathouse IV at Wed Oct 02 15:12:46 EDT 2013

AUTHOR

_Ryan Propper (rpropper(AT)stanford.edu), _, Jun 06 2005

Discussion

Wed Oct 02

15:12

OEIS Server: https://oeis.org/edit/global/1961

#2 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008

LINKS

Eric W. Weisstein. <a href="http://mathworld.wolfram.com/CompleteGraph.html">"Complete Graph."</a>

KEYWORD

easy,fini,full,nonn,new

#1 by N. J. A. Sloane at Tue Jul 19 03:00:00 EDT 2005

NAME

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

DATA

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

OFFSET

1,2

LINKS

Eric W. Weisstein. <a href="http://mathworld.wolfram.com/CompleteGraph.html">"Complete Graph."</a>

EXAMPLE

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

CROSSREFS

Cf. A108506-A108508.

KEYWORD

easy,fini,full,nonn

AUTHOR

Ryan Propper (rpropper(AT)stanford.edu), Jun 06 2005

STATUS

approved