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-3 of 3 results.

A007080 Number of labeled Eulerian digraphs with n nodes.

Original entry on oeis.org

1, 2, 10, 152, 7736, 1375952, 877901648, 2046320373120, 17658221702361472, 569773219836965265152, 69280070663388783890248448, 31941407692847758201303724506112, 56121720938871110502272391300032261120, 377362438996731353329256282026362716827887616, 9744754031799754169218003376206941877943086188308480, 969342741943194323476512925742876053501022995325734477987840
Offset: 1

Views

Author

Keywords

Comments

Includes disconnected graphs. - Felix A. Pahl, Jul 15 2018
Loops and parallel edges are not allowed, but 2-cycles (in other words, edges A --> B and B --> A existing simultaneously) are allowed. - Mikhail Lavrov, Mar 04 2025

Examples

			For n=3, the a(n) = 10 solutions are: (A . B . C), (A <--> B . C), (A <--> C . B), (B <--> C . A), (A --> B --> C --> A), (A --> C --> B --> A), (A <--> B <--> C), (A <--> C <--> B), (B <--> A <--> C), and (A <--> B <--> C <--> A). - _Mikhail Lavrov_, Mar 04 2025
		

References

  • N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Crossrefs

Cf. A058338 (unlabeled), A229865 (loops allowed), A054957 (connected) - Mikhail Lavrov, Mar 04 2025

Programs

  • Mathematica
    a[n_]:=Coefficient[Expand[Product[Product[x[i]+x[j],{j, 1, n}],{i, 1,n}]],Product[x[k]^n,{k,1,n}]]/2^n (* practically unusable for n>7 *)
    a[n_]:=N[(Sqrt[n]/E^(1/4))*(2^n/Sqrt[n*Pi])^(n-1)*(1+3/(16*n)+1/(7*n^2)+3/(20*n^3))]
    (* four digit accuracy for n>7 *) (* Thomas Curtright, Apr 12 2017 *)

Formula

a(n) ~ e^(-1/4)*sqrt(n)(2^n/sqrt(Pi*n))^(n-1)*(1+O(1/sqrt(n))) [B. D. McKay, 1990]. - Thomas Curtright, Apr 11 2017

Extensions

Terms a(12) and beyond from McKay (1983), added by Thomas Curtright, Apr 12 2017

A054958 Number of labeled connected Eulerian digraphs with n nodes and an even number of edges.

Original entry on oeis.org

1, 1, 4, 62, 3512, 664808, 434127872, 1019647584176, 8819902136975232, 284798318582888943488, 34636901578294133264379392, 15970288165992077917879019856128, 28060652850285225214988677642354678784, 188680826646319054103468721801532841166681088
Offset: 1

Views

Author

N. J. A. Sloane, May 24 2000

Keywords

Crossrefs

Programs

Formula

a(n) = (A054957 + (n-1)!)/2. - Andrew Howroyd, Sep 10 2018

Extensions

More terms from Vladeta Jovovic, Mar 06 2001
a(12)-a(14) from Andrew Howroyd, Sep 10 2018

A054959 Number of labeled connected Eulerian digraphs with n nodes and an odd number of edges.

Original entry on oeis.org

0, 0, 2, 56, 3488, 664688, 434127152, 1019647579136, 8819902136934912, 284798318582888580608, 34636901578294133260750592, 15970288165992077917878979939328, 28060652850285225214988677641875677184, 188680826646319054103468721801532834939660288
Offset: 1

Views

Author

N. J. A. Sloane, May 24 2000

Keywords

Crossrefs

Programs

Formula

a(n) = (A054957(n) - (n-1)!)/2. - Andrew Howroyd, Sep 10 2018

Extensions

More terms from Vladeta Jovovic, Mar 06 2001
a(12)-a(14) from Andrew Howroyd, Sep 10 2018
Showing 1-3 of 3 results.