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.

A361276 Number of 2413-avoiding even Grassmannian permutations of size n.

Original entry on oeis.org

1, 1, 1, 3, 6, 13, 22, 37, 55, 81, 111, 151, 196, 253, 316, 393, 477, 577, 685, 811, 946, 1101, 1266, 1453, 1651, 1873, 2107, 2367, 2640, 2941, 3256, 3601, 3961, 4353, 4761, 5203, 5662, 6157, 6670, 7221, 7791, 8401, 9031, 9703, 10396, 11133, 11892, 12697, 13525, 14401
Offset: 0

Views

Author

Juan B. Gil, Mar 10 2023

Keywords

Comments

A permutation is said to be Grassmannian if it has at most one descent. A permutation is even if it has an even number of inversions.

Examples

			For n=4 the a(4) = 6 permutations are 1234, 1342, 1423, 2314, 3124, 3412.
		

Crossrefs

For the corresponding odd permutations, cf. A006918.

Programs

  • Mathematica
    LinearRecurrence[{2,1,-4,1,2,-1},{1,1,1,3,6,13},50] (* Harvey P. Dale, Aug 14 2023 *)

Formula

G.f.: -(x^5-2*x^4-4*x^3+2*x^2+x-1)/((x+1)^2*(x-1)^4).
Showing 1-1 of 1 results.