41393

Appears in sequences

• Expansion of e.g.f. exp(x*exp(x)).at n=8A000248
• Numbers whose sum of divisors is a sixth power.at n=25A019424
• Numbers whose sum of divisors is 6^6 = 46656.at n=22A048256
• n*10^3-1, n*10^3-3, n*10^3-7 and n*10^3-9 are all prime.at n=23A064977
• Euler-Seidel matrix T(k,n) with start sequence A000248, read by antidiagonals.at n=44A098697
• Structured tetragonal anti-prism numbers.at n=32A100182
• Numbers n with omega(n) = omega of 3 nearest larger and 3 nearest smaller neighbors.at n=19A101936
• Triangle T, read by rows, equal to Pascal's triangle to the matrix power of Pascal's triangle, so that T = C^C, where C(n,k) = binomial(n,k) and T(n,k) = A000248(n-k)*C(n,k).at n=36A116071
• Triangle T(n,k)=number of forests of labeled rooted trees of height at most 1, with n labels and k nodes, where any root may contain >= 1 labels, n >= 0, 0<=k<=n.at n=44A143397
• Triangle T(n,k) = number of forests of labeled rooted trees of height at most 1, with n labels, where each root contains k labels, n>=0, 0<=k<=n.at n=37A143398
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where sequence a_k of column k is the exponential transform of C(n,k).at n=53A145460
• 1, followed by list of numbers n such that the number of strong primes and the number of weak primes are equal at the n-th prime.at n=33A175102
• Triangle T(n,k) read by rows: number of height-2-restricted finite functions.at n=36A187105
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, A(n,k) = exponential transform applied n times to identity function, evaluated at k.at n=53A209631
• Triangle read by rows: T(n,k) = number of forests of labeled rooted trees with n nodes and height at most k (n>=1, 0<=k<=n-1).at n=29A210725
• Triangle of transformation semigroup sizes generated by a single element.at n=35A225725
• Number A(n,k) of endofunctions f on [n] such that f^k(i) = f(i) for all i in [n]; square array A(n,k), n>=0, k>=0, read by antidiagonals.at n=63A245501
• Triangle read by rows: T(n,k) is the number of partial idempotent mappings (of an n-chain) with breadth exactly k.at n=44A259760
• Square array A(n,k), n>=0, k>=0, read by antidiagonals, where column k is the exponential transform of the k-th powers.at n=53A279636
• Square array T(n,k), n>=0, k>=0, read by antidiagonals, where T(0,k) = 1 and T(n,k) = k! * Sum_{i=0..n-1} binomial(n-1,i) * binomial(i+1,k) * T(n-1-i,k) for n > 0.at n=53A292978