Table of n, a(n) for n=1..13.
Eric Weisstein. "Complete Graph."
a(5) = 180 because there are 180 paths of length 5 between two arbitrary, distinct vertices in K6.
Cf. A108506, A108507, A108509.
Sequence in context: A149382 A149383 A149384 * A019309 A056632 A149385
Adjacent sequences: A108505 A108506 A108507 * A108509 A108510 A108511
Ryan Propper, Jun 06 2005