1009470

Appears in sequences

• Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 8 1-simplexes.at n=18A054559
• Smallest n-digit number with exactly n prime divisors. There are no further terms.at n=6A070842
• Geometric mean of n-th row in A076099.at n=6A076098
• Smallest number beginning with 1 and having exactly n distinct prime divisors.at n=7A077326
• Duplicate of A076098.at n=6A081970
• First occurrence (*2) of n in A088627 - or - least number that yields n different primes if you factorize it in all possible ways in two factors and add these factors.at n=32A091350
• Smallest number beginning with 1 that is the product of exactly n distinct primes.at n=7A106411
• Products of 7 distinct primes (squarefree 7-almost primes).at n=8A123321
• Numbers that are divisible by exactly 7 distinct primes.at n=8A176655
• Number of different 3 against 3 matches given n players.at n=23A271040
• Numbers that appear in A195441 at least once for two consecutive indices.at n=15A286763
• Irregular triangle read by rows: T(m, k) is the list of squarefree numbers A002110(m) < t < 2*A002110(m) such that A001221(t) = m.at n=21A288813
• Column 2 of triangle in A331431.at n=18A331434
• Smallest positive integer m with n digits and such that omega(m) = bigomega(m) = n.at n=6A342108
• Table read by row, where T(n,k), n>0 and k>0, represents the smallest n-digit number that is the product of k distinct primes and is sandwiched between semiprime numbers, or -1 if no such number exists.at n=31A379167
• Size of the largest component of the blet graph for n coins.at n=20A381814
• Irregular triangle read by rows: T(n,k) (n >= 4, 4 <= k <= A384502(n)) is the smallest n-digit number m with k distinct prime factors, such that these factors can be divided into two subsets of at least two elements each, both summing to the same value. If no such number exists, T(n,k) = -1.at n=11A383858