38592

Appears in sequences

• Sequence A154693 adjusted to leading one:t(n,m)=A154693(n,m)-A154693(n,0)+1.at n=24A174672
• Numbers with 42 divisors.at n=35A175750
• Numbers of the form p^6*q^2*r where p, q, and r are distinct primes.at n=33A179703
• Number of partitions of n into distinct parts with boundary size 10.at n=37A227567
• Number of arrays of length n that are sums of 2 consecutive elements of length n+1 permutations of 0..n.at n=6A229560
• T(n,k) = number of arrays of length n that are sums of k consecutive elements of length n+k-1 permutations of 0..n+k-2.at n=34A229565
• a(n) = n! * [x^n] exp(n*x)*tanh(x).at n=6A302587
• Numbers that can be written as (k + sum of digits of k) for some k, then as (m + product of digits of m) for some m, also as (q * product of digits of q) for some q, and finally as (t * sum of digits of t) for some t.at n=41A337839
• Number of unordered pairs of self-avoiding paths with nodes that cover all vertices of a convex n-gon; one-node paths are allowed.at n=8A359405
• Triangle read by rows: T(n,k) is the number of sets of noncrossing paths of size k that cover n nodes arranged in a circle with one node paths allowed, 0 <= k <= n.at n=47A390894
• a(n) = (1/4) * Sum_{k>=0} (3/4)^k * |Stirling1(n+k,k)|.at n=3A390900