82110

Appears in sequences

• Numbers whose sum of divisors is a fifth power.at n=26A019423
• a(n) = n*(n+1)*(2*n+1).at n=34A055112
• Products of exactly 6 distinct primes.at n=13A067885
• Integers which have more than one coprime factorization into nonprime powers which sum to the same number.at n=5A072940
• Duplicate of A076978.at n=18A074168
• Numbers with six distinct prime divisors.at n=15A074969
• Product of the distinct primes dividing the product of composite numbers between consecutive primes.at n=18A076978
• Product of all distinct prime factors of all composite numbers between n-th prime and next prime.at n=17A079615
• Records in A152235.at n=44A152452
• Numbers k such that Euler phi(Dedekind psi(k)) > k.at n=4A196200
• a(n) = n*(n + 11)*(n + 22)*(n + 33)/24.at n=23A264448
• Number n such that there are no primes of the form sigma(n)/k where 1 < k < n is a (proper) nondivisor of n.at n=38A283147
• Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).at n=11A285615
• Numbers that appear in A195441 at least once for two consecutive indices.at n=10A286763
• Even bisection of A318256.at n=33A306745
• Product of all primes p not dividing n such that the sum of the base-p digits of n is at least p, or 1 if no such prime exists.at n=66A324370
• Unitary barely 3-abundant: numbers m such that 3 < usigma(m)/m < usigma(k)/k for all numbers k < m, where usigma is the sum of unitary divisors function (A034448).at n=8A336671
• 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=18A336910
• Lexicographically earliest sequence of positive distinct terms such that the digital root of a(n) is the number of distinct prime factors of a(n+1).at n=34A337096
• G.f. A(x) satisfies: 0 = Sum_{n=-oo..+oo} x^(n*(n-1)/2) * (x^n - A(x))^n.at n=10A355861