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.

A259876 Triangle of numbers S(n,k) (0 <= k <= n) arising in the enumeration of interval orders without duplicated holdings.

Original entry on oeis.org

1, 1, -1, 3, -3, 1, 21, -21, 7, -1, 315, -315, 105, -15, 1, 9765, -9765, 3255, -465, 31, -1, 615195, -615195, 205065, -29295, 1953, -63, 1, 78129765, -78129765, 26043255, -3720465, 248031, -8001, 127, -1, 19923090075, -19923090075, 6641030025, -948718575, 63247905, -2040255, 32385, -255, 1
Offset: 0

Views

Author

N. J. A. Sloane, Jul 09 2015

Keywords

Examples

			Triangle begins:
     1;
     1,    -1;
     3,    -3,    1;
    21,   -21,    7,   -1;
   315,  -315,  105,  -15,  1;
  9765, -9765, 3255, -465, 31, -1;
  ...
		

References

  • T. L. Greenough, Enumeration of interval orders without duplicated holdings, Preprint, circa 1976.

Crossrefs

Row sums give A005327.
Column k=0 gives A005329.
Main diagonal gives A033999.
T(n+1,n) gives A225883(n+1).

Formula

T(n,k) = qfactorial(n)/qfactorial(k)*(-1)^(k), n>=k, where qfactorial(n) is A005329. - Vladimir Kruchinin, Feb 17 2020

Extensions

More terms from Alois P. Heinz, Feb 17 2020