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.

Showing 1-1 of 1 results.

A277086 Irregular triangle read by rows: T(n,k) = number of size k subsets of S_n with respect to the symmetries of the square.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 1, 2, 5, 5, 5, 2, 1, 1, 7, 56, 317, 1524, 5733, 17728, 44767, 94427, 166786, 249624, 316950, 343424, 316950, 249624, 166786, 94427, 44767, 17728, 5733, 1524, 317, 56, 7, 1, 1, 23, 1012, 36125, 1035496, 23878229, 456936220, 7437730463
Offset: 0

Views

Author

Christian Bean, Sep 28 2016

Keywords

Comments

A permutation, p, can be thought of as a set of points (i, p(i)). In this viewpoint it is natural to consider the symmetries of the square.
T(n,k) is the number of symmetry classes of subsets of size k from S_n.

Examples

			Triangle starts:
1, 1;
1, 1;
1, 1, 1;
1, 2, 5, 5, 5, 2, 1;
		

Crossrefs

Rows lengths give A038507.

Formula

T(n,k) = 1/8 * (C(n,k) + 2*A277080(n,k) + 2*A277081(n,k) + 2*A277085(n,k) + A277083(n,k)).
Showing 1-1 of 1 results.