335160

Appears in sequences

• Expansion of e.g.f. tanh(arcsinh(x) + log(x+1)).at n=8A013076
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=33A059436
• Triangle, rows = inverse binomial transforms of A073133 columns.at n=41A117936
• Triangle T(n,k), n >= 0, 0 <= k <= n, read by rows: T(n,k) is the number of forests of trees on n or fewer nodes using a subset of labels 1..n and k edges.at n=42A144258
• Numbers with prime factorization pqr^2s^2t^3.at n=15A190386
• Triangle with entry a(n,m) giving the total number of bracelets of n beads (D_n symmetry) with n colors available for each bead, but only m distinct colors present, with m from {1, 2, ..., n} and n >= 1.at n=33A214306
• a(n) = sigma(sigma(p(n))) = sum of the divisors of the sum of the divisors of number of partitions of n.at n=43A280101
• Square array A(n,k), n >= 0, k >= 0, read by antidiagonals, where column k is the expansion of e.g.f. Product_{i>0} 1/(Sum_{j=0..k} (-1)^j*x^(j*i)/j!).at n=63A293301
• E.g.f.: Product_{m>0} 1/(1 - x^m + x^(2*m)/2!).at n=8A293302
• Irregular triangle read by rows: T(n,m) is the number of n X m (0,1)-matrices with pairwise distinct nonzero columns and pairwise distinct nonzero rows, n >= 0, m = 0..2^n-1.at n=20A318537
• Irregular triangle read by rows: T(n,m) is the number of n X m (0,1)-matrices with pairwise distinct nonzero columns and pairwise distinct nonzero rows, n >= 0, m = 0..2^n-1.at n=35A318537
• E.g.f. satisfies A(x)^A(x) = 1/(1 - x)^(x^2/2).at n=10A356912
• Expansion of e.g.f. 1/(1 - (exp(x^3) - 1)/x^2)^3.at n=7A375813