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.

A370576 a(n) is the difference between the number of n-dist-increasing and (n-1)-dist-increasing permutations p of [2n], where p is k-dist-increasing if k>=0 and p(i) for all i in [2n-k].

Table of values

n a(n)
0 1
1 1
2 5
3 70
4 1960
5 88200
6 5821200
7 529729200
8 63567504000
9 9725828112000
10 1847907341280000
11 426866595835680000
12 117815180450647680000
13 38289933646460496000000
14 14473594918362067488000000
15 6296013789487499357280000000
16 3122822839585799681210880000000

List of values

[1, 1, 5, 70, 1960, 88200, 5821200, 529729200, 63567504000, 9725828112000, 1847907341280000, 426866595835680000, 117815180450647680000, 38289933646460496000000, 14473594918362067488000000, 6296013789487499357280000000, 3122822839585799681210880000000]