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.

A376162 Number of ordered partitions of S={(i,j):1 <= i , j <= n} where for every i and j the pairs (i+1,j) and (i,j+1) are in a later part than the part containing the pair (i,j), and the pairs (i,j), (j,i) are in the same part.

Table of values

n a(n)
1 1
2 1
3 3
4 39
5 2905
6 1538369
7 6904262355
8 304662492057063
9 150347237334006997801
10 929721796071361437087789041
11 79773595676787229793797978773561927
12 104165556509336140832819242491033872033130063
13 2252283824141388832759484222915451435885285752729087857

List of values

[1, 1, 3, 39, 2905, 1538369, 6904262355, 304662492057063, 150347237334006997801, 929721796071361437087789041, 79773595676787229793797978773561927, 104165556509336140832819242491033872033130063, 2252283824141388832759484222915451435885285752729087857]