6881280

Appears in sequences

• Least number whose number of divisors is n-th term from A014613 (numbers of form p*q*r*s, products of exactly 4 primes, counted with multiplicity).at n=16A061218
• Least m with n*(n+1)/2 divisors.at n=15A081620
• a(n) = smallest k such that tau(k)= n*tau(k-1) where tau(k) = number of divisors of k, or 0 if no such number exists.at n=33A086551
• a(n) = n*(n-1)*2^n.at n=15A128796
• Numbers k such that k is a member of A002183 but 2*k is not.at n=6A160233
• Triangular array read by rows. T(n,k) is the number of k-colored labeled digraphs with n vertices, n>=1, 1<=k<=n.at n=12A240955
• Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 782", based on the 5-celled von Neumann neighborhood.at n=22A290301
• p-INVERT of (1,1,1,1,1,...), where p(S) = (1 - 3*S)^2.at n=9A291004
• Number of maximum independent vertex sets and minimum vertex covers in the n-web graph.at n=33A297439
• (1/4) times the sum of the elements of all subsets of [n] whose sum is divisible by four.at n=20A309296
• Number of ways to choose a factorization of each integer from 2 to n into factors > 1.at n=25A321514
• Heinz numbers of integer partitions, with at least three parts, whose product of parts is one fewer than their sum.at n=31A325043
• Triangle read by rows: T(n,m)=4^(n-1)*C(n,m)*C(3*n/2-2,n-1)/n, for 0 <= m <= n, with T(0,0)=1.at n=38A360667
• Triangle read by rows: T(n,m)=4^(n-1)*C(n,m)*C(3*n/2-2,n-1)/n, for 0 <= m <= n, with T(0,0)=1.at n=42A360667