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.

A219587 Noncrossing, nonnesting, 2-arc-colored permutations on the set {1..n} where lower arcs even of different colors do not cross.

Original entry on oeis.org

1, 2, 8, 40, 224, 1296, 7568, 44304, 259536, 1520656, 8910160, 52209040, 305919696, 1792542992, 10503446608, 61545189520, 360625475024, 2113093401616, 12381720203088, 72550979111824, 425114158957776, 2490966357221136, 14595875630354000, 85524874633320080
Offset: 0

Views

Author

Lily Yen, Nov 23 2012

Keywords

Comments

The sequence is generated by a rational function, in particular, a quotient of two determinants.

Examples

			For n=4, the a(4) = 224 solutions are 24 permutations, 8 of which can be colored in 4 ways each, 8 in 8 ways each, and 8 in 16 ways each, thus resulting in 8 * (4+8+16) = 224.
		

Programs

  • PARI
    Vec((1 - 5*x) / (1 - 7*x + 6*x^2 + 4*x^3) + O(x^40)) \\ Colin Barker, Jun 22 2019

Formula

G.f.: (1 - 5*x)/(1 - 7*x + 6*x^2 + 4*x^3).
a(n) = 7*a(n-1) - 6*a(n-2) - 4*a(n-3) for n>2. - Colin Barker, Jun 22 2019

Extensions

Name modified by Lily Yen, Apr 23 2013