123480
domain: N
Appears in sequences
- Triangle of coefficients in expansion of (6+7x)^n.at n=18A013627
- Triangle whose (i,j)-th entry is binomial(i,j)*7^(i-j)*6^j.at n=17A038272
- Partition number array, called M31(6), related to A049374(n,m)= |S1(6;n,m)| (generalized Stirling triangle).at n=35A144356
- A145312(n)/1440.at n=13A145346
- a(n) = least n-distinct-decimal-digit number such that the string formed by the last k digits is divisible by k for any 1<=k<=n.at n=5A147636
- a(n) = (sum of first n primes) * n.at n=39A167214
- a(n) is the number of (0,1) matrices A=(a_{ij}) of size n X (3n) such that each row has exactly three 1's and each column has exactly one 1 and with the restriction that no 1 stands on the diagonal from a_{11} to a_{22}.at n=3A173789
- Triangle T(n, k) = round(c(n)/(c(k)*c(n-k))) where c(n) = ((n-1)! * n! * (n+1)!)/ 2^(n-1) if n >= 2, otherwise 1, read by rows.at n=40A174150
- Numbers with prime factorization pq^2r^3s^3.at n=11A190320
- Triangular array: T(n,k) = sqrt(C(n-1,k-1)*C(n-1,k)*C(n,k+1)* C(n+1,k+1)*C(n+1,k)*C(n,k-1)), where C(n,k) = binomial(n,k).at n=23A197208
- Triangular array: T(n,k) = sqrt(C(n-1,k-1)*C(n-1,k)*C(n,k+1)* C(n+1,k+1)*C(n+1,k)*C(n,k-1)), where C(n,k) = binomial(n,k).at n=25A197208
- 1/4 the number of (n+1) X 2 0..3 arrays with every 2 X 2 subblock having distinct edge sums.at n=5A209729
- 1/4 the number of (n+1) X 7 0..3 arrays with every 2 X 2 subblock having distinct edge sums.at n=0A209734
- T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having distinct edge sums.at n=15A209736
- T(n,k)=1/4 the number of (n+1)X(k+1) 0..3 arrays with every 2X2 subblock having distinct edge sums.at n=20A209736
- n-th derivative of cosh(x)^sin(x) at x=0.at n=10A215583
- n-th derivative of cos(x)^tanh(x) at x=0.at n=10A215585
- n-th derivative of cosh(x)^tan(x) at x=0.at n=10A215587
- n-th derivative of sec(x)^sinh(x) at x=0.at n=10A215678
- n-th derivative of sech(x)^tan(x) at x=0.at n=10A215681