85470

Appears in sequences

• Areas of more than one primitive Pythagorean triangle.at n=4A024407
• Products of exactly 6 distinct primes.at n=15A067885
• Numbers with six distinct prime divisors.at n=17A074969
• Product of the distinct primes dividing the product of composite numbers between consecutive primes.at n=28A076978
• Product of all distinct prime factors of all composite numbers between n-th prime and next prime.at n=27A079615
• Consider a Pythagorean triangle with sides a=u^2-v^2, b=2uv, c=u^2+v^2. The sequence is the area of the triangle when v=2, u=3,4,5,...at n=32A096382
• Sum of numbers under a triangle on a spiral staircase of width 10.at n=34A111080
• a(n) = rad(A143176(n)).at n=36A144361
• Worpitzky(n, k)*Harmonic(k), triangle read by rows.at n=39A176276
• a(n) = the smallest number k such that k*n is a number with a string of 1's followed by a string of 0's.at n=12A276348
• Numbers k such that usigma(k) >= 3*k, where usigma(k) = sum of unitary divisors of k (A034448).at n=13A285615
• a(n) = k if the first appearance of n in A077618 is at index k, or 0 if k does not appear in A077618.at n=47A291056
• Product of all distinct least part primes from all partitions of n into prime parts.at n=37A333129
• 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=20A336910
• 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=47A337096
• Number of ways to write n as an ordered sum of 7 nonzero decimal palindromes.at n=17A341204
• Squarefree 3-abundant numbers: squarefree numbers k such that A000203(k) > 3*k.at n=13A387153