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.

A355612 Number of labeled digraphs on [n] such that for any pair C_1,C_2 of distinct strongly connected components, if x in C_1 is directed to y in C_2 then every vertex in C_1 is directed to every vertex in C_2.

Table of values

n a(n)
0 1
1 1
2 4
3 52
4 2524
5 629296
6 750098464
7 3540134362192
8 63605185617860464
9 4402130837352016607296
10 1190565802204629673473661504
11 1270503156085666608161173288964992
12 5381113705726490960372769906727545572224
13 90765998703828737395601069325546106634460887296
14 6109068274998388232409260496587163340177606642565219584

List of values

[1, 1, 4, 52, 2524, 629296, 750098464, 3540134362192, 63605185617860464, 4402130837352016607296, 1190565802204629673473661504, 1270503156085666608161173288964992, 5381113705726490960372769906727545572224, 90765998703828737395601069325546106634460887296, 6109068274998388232409260496587163340177606642565219584]

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.