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.

A361583 Number of digraphs on n unlabeled nodes whose strongly connected components are complete digraphs.

Original entry on oeis.org

1, 1, 3, 12, 88, 1217, 34672, 2039085, 246005109, 60296886108, 29828186693218, 29663937774464786, 59172529527454608139, 236453014376786629601848, 1891427400988740573006253862, 30274661556583530830890359188257, 969429810937979825934973090455224882
Offset: 0

Views

Author

Andrew Howroyd, Mar 16 2023

Keywords

Crossrefs

The labeled version is A361560.
Cf. A000273, A350794, A361584, A361585.

Programs

A361584 Number of digraphs on n unlabeled nodes whose strongly connected components are directed cycles or single vertices.

Original entry on oeis.org

1, 1, 3, 12, 88, 1239, 36540, 2226595, 277421616, 69974281748, 35535207035048, 36224521019293188, 74004483908461354689, 302712665772844097945072, 2477999475270966827490305948, 40583406022745170376459610683073, 1329552679157905406495248763876363056
Offset: 0

Views

Author

Andrew Howroyd, Mar 16 2023

Keywords

Crossrefs

The labeled version is A011266.
Cf. A350794, A361583, A361585 (without single vertex components).

Programs

Formula

a(n) >= A361583(n).
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.