131275

Appears in sequences

• T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=48A046802
• T(n, k) = Sum_{j=k..n} binomial(n, j)*E1(j, j-k), where E1 are the Eulerian numbers A173018. Triangle read by rows, T(n, k) for 0 <= k <= n.at n=51A046802
• Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j-1,-n-1)*E1(j,k), E1 the Eulerian numbers A173018, for n >= 0 and 0 <= k <= n.at n=47A272098
• Triangle read by rows, T(n,k) = Sum_{j=0..n} (-1)^(n-j)*C(-j-1,-n-1)*E1(j,k), E1 the Eulerian numbers A173018, for n >= 0 and 0 <= k <= n.at n=50A272098
• Expansion of Product_{k>=1} (1 - prime(k)*x^k).at n=27A304791