108570

Appears in sequences

• Number of labeled pure 2-complexes on n nodes (0-simplexes) with 5 2-simplexes and 9 1-simplexes.at n=6A054558
• Triangle T(n,k) = binomial(n+2,k+1)*(binomial(n+2,k+1)-1), n >=0, 0 <= k <= n.at n=48A065420
• Products of exactly 6 distinct primes.at n=24A067885
• Numbers with six distinct prime divisors.at n=31A074969
• a(n) =(A001359[n]^2-1)/2.at n=29A117849
• Numbers k such that Euler phi(Dedekind psi(k)) > k.at n=6A196200
• Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).at n=19A285615
• Numbers k > 2 such that omega(k) > log(log(k)) + 2 * sqrt(log(log(k))), where omega(k) is the number of distinct primes dividing k (A001221).at n=34A336910
• Oblong numbers which are products of six distinct primes.at n=3A359127
• Squarefree 3-abundant numbers: squarefree numbers k such that A000203(k) > 3*k.at n=19A387153