a(n) = GCD({(2*n-k)*T(n,k)+(k+1)*T(n,k+1), k=0..n}), where T(n,k) stands for A214406 (the second-order Eulerian numbers of type B).

A339100

a(n) = GCD({(2*n-k)*T(n,k)+(k+1)*T(n,k+1), k=0..n}), where T(n,k) stands for A214406 (the second-order Eulerian numbers of type B).

Terms

    a(0) =1a(1) =6a(2) =1a(3) =60a(4) =1a(5) =42a(6) =1a(7) =120a(8) =1a(9) =66a(10) =1a(11) =5460a(12) =1a(13) =6a(14) =1a(15) =4080a(16) =1a(17) =798a(18) =1a(19) =3300a(20) =1a(21) =138a(22) =1a(23) =10920a(24) =1a(25) =6a(26) =1a(27) =1740a(28) =1a(29) =14322

External references