25076

Appears in sequences

• Number of solid partitions of n supported on graph of cube.at n=28A003404
• Growth series for Heisenberg group.at n=25A063810
• Nearest integer to (-1)^n*n!*(E(n,2)-E(n,1)*E(n-1,1)) where E(n,x) = Sum_{k=0..n} (-1)^k*x^k/k!.at n=18A065954
• a(n) = ceiling((-1)^n*n!*(E(n,2)-E(n,1)*E(n-1,1))) where E(n,x) = Sum_{k=0..n} (-1)^k*x^k/k!.at n=18A065956
• Number of nX6 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=6A207680
• Number of 7Xn 0..1 arrays avoiding 0 0 0 and 1 0 1 horizontally and 0 0 1 and 1 1 1 vertically.at n=5A207687
• Number of compositions of n into distinct parts with exactly one descent.at n=35A241720
• E.g.f. satisfies: A(x) = exp(Integral(1+x*A(x)^5) dx), where the constant of integration is zero.at n=6A245267
• Number of (n+2)X(3+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two sums of the central column and central row nondecreasing horizontally and vertically.at n=3A258521
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two sums of the central column and central row nondecreasing horizontally and vertically.at n=17A258522
• T(n,k)=Number of (n+2)X(k+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two sums of the central column and central row nondecreasing horizontally and vertically.at n=18A258522
• Numbers n such that n!3 + 3^7 is prime, where n!3 = n!!! is a triple factorial number (A007661).at n=36A265200
• Sum of the even parts in the partitions of n into 6 parts.at n=37A309552
• Numbers k such that there are exactly five biquadratefree powerful numbers (A338325) between k^2 and (k+1)^2.at n=3A338392