A317483 Circuit rank of the n-Bruhat graph.

0, 0, 1, 13, 121, 1081, 10081, 100801, 1088641, 12700801, 159667201, 2155507201, 31135104001, 479480601601, 7846046208001, 135998134272001, 2489811996672001, 48017802792960001, 973160803270656001, 20679667069501440001, 459818479545384960001, 10678006913887272960001

Offset

1,4

Links

Andrew Howroyd, Table of n, a(n) for n = 1..200

Eric Weisstein's World of Mathematics, Bruhat Graph

Eric Weisstein's World of Mathematics, Circuit Rank

Formula

From Andrew Howroyd, Jul 30 2018: (Start)

a(n) = A001286(n) - A000142(n) + 1.

a(n) = (n-3)*n!/2 + 1. (End)

Mathematica

Table[(n - 3) n!/2 + 1, {n, 20}] (* Eric W. Weisstein, May 10 2019 *)

Prog

(PARI) a(n)={n!*(n-1)\2 - n! + 1} \\ Andrew Howroyd, Jul 30 2018

Crossrefs

Cf. A000142, A001286.

Sequence in context: A081033 A091111 A196921 * A096053 A033470 A297594

Adjacent sequences: A317480 A317481 A317482 * A317484 A317485 A317486

Keyword

nonn,easy

Author

Eric W. Weisstein, Jul 29 2018

Extensions

Terms a(7) and beyond from Andrew Howroyd, Jul 30 2018

Status

approved