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.

A350191 Number of ways of placing maximum number of nonattacking rooks on a triangular board with edge-length n (not counting rotations and reflections as distinct).

Original entry on oeis.org

1, 1, 1, 1, 5, 3, 1, 45, 29, 5, 807, 422, 29, 20022, 8270, 224, 642162, 211848, 3012
Offset: 1

Views

Author

Vaclav Kotesovec, Dec 19 2021

Keywords

Comments

a(n) = A350041(n) for n <> 10,13,16,19,...
Conjecture: a(3*n-2) = A309260(n). There is a nice analogy with A289893(3*n+1) = A002047(n).

Crossrefs