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.

A326251 Number of digraphs with vertices {1..n} whose increasing edges are not crossing.

Table of values

n a(n)
0 1
1 2
2 16
3 512
4 49152
5 11534336
6 6039797760
7 6768868458496
8 15885743998107648
9 77083611222073409536
10 767126299049285413502976
11 15572324598183490228037091328
12 642316330843573124053884695740416
13 53681919993405760099480940765478125568

List of values

[1, 2, 16, 512, 49152, 11534336, 6039797760, 6768868458496, 15885743998107648, 77083611222073409536, 767126299049285413502976, 15572324598183490228037091328, 642316330843573124053884695740416, 53681919993405760099480940765478125568]

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

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