151695

Appears in sequences

• Let a(0) = a(1) = 1, and n*a(n) = 2*(-7+5*n)*a(n-1) + 9*(2-n)*a(n-2) for n >= 2.at n=8A162326
• Let y = y(u,v) be implicitly defined by g(u,v,y(u,v)) = 0. Read as a triangle by rows, the sequence represents the number of terms a(i,k-i) in the expansion of the bivariate divided difference [u_0,...,u_i; v_0,...,v_{k-i}]y in terms of trivariate divided differences of g.at n=35A172003
• Number of distinct solutions of sum{i=1..4}(x(2i-1)*x(2i)) = 0 (mod n), with x() in 0..n-1.at n=11A180796
• Triangle with first column identical to 1 and the other entries defined by the sum of entries above and to the left.at n=44A226392
• Number of length n 1..(2+2) arrays with no leading or trailing partial sum equal to a prime.at n=15A254198
• Square array T(n,k), n >= 0, k >= 0, read by antidiagonals, where T(n,k) = Sum_{j=0..n} k^j*binomial(n,j)*Catalan(j).at n=52A340968