-8733

Appears in sequences

• Riordan's general Eulerian recursion: T(n, k) = (k+2)*T(n-1, k) + (n-k-1) * T(n-1, k-1) with T(n,1) = 1, T(n,n) = (-1)^(n-1).at n=30A157013
• a(n) = 3*a(n-1) - 8*a(n-2), with a(0)=0, a(1)=1.at n=10A190962