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.

A317483 Circuit rank of the n-Bruhat graph.

This page as a plain text file.
%I A317483 #14 Feb 16 2025 08:33:56
%S A317483 0,0,1,13,121,1081,10081,100801,1088641,12700801,159667201,2155507201,
%T A317483 31135104001,479480601601,7846046208001,135998134272001,
%U A317483 2489811996672001,48017802792960001,973160803270656001,20679667069501440001,459818479545384960001,10678006913887272960001
%N A317483 Circuit rank of the n-Bruhat graph.
%H A317483 Andrew Howroyd, <a href="/A317483/b317483.txt">Table of n, a(n) for n = 1..200</a>
%H A317483 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/BruhatGraph.html">Bruhat Graph</a>
%H A317483 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/CircuitRank.html">Circuit Rank</a>
%F A317483 From _Andrew Howroyd_, Jul 30 2018: (Start)
%F A317483 a(n) = A001286(n) - A000142(n) + 1.
%F A317483 a(n) = (n-3)*n!/2 + 1. (End)
%t A317483 Table[(n - 3) n!/2 + 1, {n, 20}] (* _Eric W. Weisstein_, May 10 2019 *)
%o A317483 (PARI) a(n)={n!*(n-1)\2 - n! + 1} \\ _Andrew Howroyd_, Jul 30 2018
%Y A317483 Cf. A000142, A001286.
%K A317483 nonn,easy
%O A317483 1,4
%A A317483 _Eric W. Weisstein_, Jul 29 2018
%E A317483 Terms a(7) and beyond from _Andrew Howroyd_, Jul 30 2018