-10206

Appears in sequences

• Triangular array of coefficients multiplied by n! of polynomials in e. These give the expected number of trials needed for the sum of uniform random variables from the interval [0,1] to exceed n+1.at n=33A089087
• Triangle read by rows: The n-th derivative of the logistic function written in terms of y, where y = 1/(1 + exp(-x)).at n=31A163626
• Triangle, read by rows, T(n,k) = (-1)^k*binomial(n, k)*3^(n-k).at n=50A164942
• Villegas-Zagier polynomials (listing coefficients from lowest to highest degree).at n=61A166243
• Villegas-Zagier polynomials (listing coefficients from highest to lowest degree).at n=53A166244
• Coefficients of (x^(1/3)*d/dx)^n for positive integer n.at n=37A223533
• Triangle read by rows: terms T(n,k) of a binomial decomposition of n as Sum(k=0..n)T(n,k).at n=30A244131
• Triangle read by rows: the negative terms of A163626.at n=13A245602
• Triangle read by rows of coefficients in expansion of (3-2x)^n, where n is a nonnegative integer.at n=29A303901
• Triangle read by rows: T(0,0) = 1; T(n,k) = 3*T(n-1,k) - 2*T(n-2,k-1) for k = 0..floor(n/2); T(n,k)=0 for n or k < 0. Triangle of coefficients of Fermat polynomials.at n=21A303941
• Triangle read by rows of coefficients in expansions of (-2 + 3*x)^n, where n is nonnegative integer.at n=34A317498
• Triangle read by rows: T(0,0) = 1; T(n,k) = 3 T(n-1,k) - 2 * T(n-3,k-1) for k = 0..floor(n/3); T(n,k)=0 for n or k < 0.at n=19A317502