The number of pop-stacked permutations of [n] for n = 1 to 1000 (sequence A307030 in the OEIS) as well as a triangle of numbers giving the number of pop-stacked permutations of each length grouped by

Harvard Dataverse2020-04-14 更新20

The number of alternating sign matrices of size n for n = 1 to 20.

组合计数

交替符号矩阵

A file used for the "Working with files" chapter of the Python for Mathematics book.

Zenodo2024-05-10 更新10

Exact number of BTC networks over [n] for n = 1, …, 7, an estimate for n = 8, and their upper bounds for n ≤ 10.

组合计数

离散数学结构

Exact number of BTC networks over [n] for n = 1, …, 7, an estimate for n = 8, and their upper bounds for n ≤ 10.

Figshare2019-09-11 更新00

The number of alternating sign matrices of size n for n = 1 to 20.

资源简介：

相关数据集