91440

Appears in sequences

• a(n) = (n-1)!*(2^n-1) for n>=1, a(0)=0.at n=7A029767
• "CHJ" (necklace, identity, labeled) transform of 1,3,5,7...at n=6A032332
• Distribution of maximum inversion table entry.at n=42A056151
• Diagonal of A056151.at n=6A056197
• Matrix product of unsigned Lah-triangle |A008297(n,k)| and unsigned Stirling1-triangle |A008275(n,k)|.at n=21A079638
• Triangle T, read by rows, equal to the matrix inverse of the triangle defined by [T^-1](n,k) = A075263(n,k)/n!, for n>=k>=0.at n=34A106338
• Exponential Riordan array [1, log((1-x)/(1-2x))].at n=29A131222
• Numbers in A075728 which are not one less than some prime.at n=39A179232
• Number of (n+1) X 2 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=3A205937
• Number of (n+1) X 5 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=0A205940
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=6A205944
• T(n,k) = number of (n+1) X (k+1) 0..3 arrays with no 2 X 2 subblock having the number of clockwise edge increases equal to the number of counterclockwise edge increases in its adjacent leftward or upward neighbors.at n=9A205944
• Number of (n+2) X (3+2) 0..2 arrays with every consecutive three elements in every row, column, diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=9A252856
• a(n) = Sum_{d|n} d^Omega(d).at n=44A344459
• Array read by ascending antidiagonals. A(n, k) = k! * [x^k] log((1 - x) / (1 - 2*x)) / (1 - x)^n, for 0 <= k <= n.at n=35A355257
• Triangle read by rows. Row k are the coefficients of the polynomials (sorted by ascending powers) which interpolate the points (n, A355257(n, k+1)) for n = 0..k.at n=21A355259
• Triangle read by rows: T(n, k) = n! * Sum_{j=0..n-1} binomial(k - 1, j) / (j + 1).at n=35A371685