88200

Appears in sequences

• Smallest order for which there are n nonisomorphic finite Abelian groups, or 0 if no such order exists.at n=23A046056
• Number of n-digit numbers with maximal multiplicative persistence A014553.at n=9A046148
• Number of functions from a set to itself such that the sizes of the preimages of the individual elements in the range form the n-th partition in Abramowitz and Stegun order.at n=40A049009
• Number of functions from a set to itself such that the sizes of the preimages of the individual elements in the range form the n-th partition in Abramowitz and Stegun order.at n=41A049009
• Number of endofunctions on n labeled points constructed from k rooted trees.at n=25A066324
• Denominator of Sum_{k=1..n} phi(k)/k^2.at n=6A072157
• Permutation of A025487 (least prime signatures) which, when values are factored, exhibit self-similarity (cf. A008687).at n=46A086141
• Number of A095322-primes in range ]2^n,2^(n+1)].at n=21A095324
• Number of A095318-primes in range ]2^n,2^(n+1)].at n=21A095328
• a(1)=1, a(n) = n*a(floor(n/2)).at n=41A098844
• Smallest order for which there are n nonisomorphic finite Hamiltonian groups, or 0 if no such order exists.at n=7A104453
• Transform of n^3 by the Riordan array (1/(1-x^2), x).at n=28A105636
• Exponential (binomial) convolution of A001818 (with interspersed zeros) and A000142 (factorials).at n=7A111601
• a(n) is the smallest number representable in exactly n ways as a sum of 2 powerful(1) numbers.at n=21A115354
• Triangle read by rows: T(n,k) is the number of deco polyominoes of height n and having k 1-cell columns starting at level 0 (0<=k<=n). A deco polyomino is a directed column-convex polyomino in which the height, measured along the diagonal, is attained only in the last column.at n=46A121585
• Smallest number m having exactly n divisors d with sqrt(m/2) <= d < sqrt(2*m).at n=11A128605
• Number of entries in the second cycles of all permutations of {1,2,...,n}; each cycle is written with the smallest element first and cycles are arranged in increasing order of their first elements.at n=7A138772
• Triangle T(n, k, m) = (m+1)^n*t(n, m)*t(k, n-m)/(k! * (n-k)!), where T(0, k, m) = 1, t(n, k) = Product_{j=1..n} ( Sum_{i=0..j-1} (m+1)^i ), and t(n, 0) = n!, read by rows.at n=13A157285
• A partition product of Stirling_1 type [parameter k = -4] with biggest-part statistic (triangle read by rows).at n=25A157384
• a(n) = 81*n^2 - 9.at n=32A157909