cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-2 of 2 results.

A108507 Number of paths of length n between two arbitrary, distinct vertices in K5, the complete graph on 5 vertices.

Original entry on oeis.org

1, 3, 6, 18, 48, 78, 96, 132, 132
Offset: 1

Views

Author

Ryan Propper, Jun 06 2005

Keywords

Comments

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

Examples

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

Links

Crossrefs

Cf. A108506, A108508, A108509.

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

Original entry on oeis.org

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

Views

Author

Ryan Propper, Jun 06 2005

Keywords

Examples

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

Links

Crossrefs

Cf. A108506, A108507, A108508.
Showing 1-2 of 2 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.