A155519
a(n) = Sum (J(p): p is a permutation of {1,2,…,n}), where J(p) is the number of j <= ceiling(n/2) such that p(j) + p(n+1-j) = n+1.
offset: 1
codomain: ℕ
Declarations
Section titled “Declarations”- A155519computable
a(n) = Sum (J(p): p is a permutation of {1,2,…,n}), where J(p) is the number of j <= ceiling(n/2) such that p(j) + p(n+1-j) = n+1.