39270

Appears in sequences

• a(n) = (4*n+1)*(4*n+2)*(4*n+3).at n=8A001505
• a(n) = n*(n-1)*(n-2) (or n!/(n-3)!).at n=35A007531
• a(n) = floor( n*(n-1)*(n-2)*(n-3)/32 ).at n=35A011942
• a(n) = lcm(n,n+1,n+2).at n=32A033931
• Products of successive Fibonacci numbers.at n=42A034722
• Triangle read by rows in which row n contains first n numbers with exactly n distinct prime factors.at n=16A048692
• Golden rectangular box numbers: a(n) = n*A007067(n)*A007067(A007067(n)).at n=21A050510
• Denominator of b(n)-b(n+1), where b(n) = n/((n+1)(n+2)) = A026741/A045896.at n=31A051713
• Product of three consecutive Fibonacci numbers.at n=7A065563
• Numbers k such that phi(k) < k/5.at n=1A066765
• Products of exactly 6 distinct primes.at n=1A067885
• a(n) = (2n+1)*(2n+2)*(2n+3).at n=16A069072
• Duplicate of A048692.at n=16A074095
• Duplicate of A076978.at n=10A074168
• Numbers with six distinct prime divisors.at n=1A074969
• List of codewords in binary lexicode with Hamming distance 8 written as decimal numbers.at n=18A075940
• Integers k such that omega(k) = omega(k-1) + omega(k-2) + omega(k-3), where omega(n) is the number of distinct prime factors of n.at n=32A076252
• Product of the distinct primes dividing the product of composite numbers between consecutive primes.at n=10A076978
• Triangle read by rows: T(n,k) = A002110(n)/prime(n+1-k), k = 1..n.at n=22A077011
• a(n) = rad(n(n+1)(n+2)), where rad(m) is the largest squarefree number dividing m (see A007947).at n=32A078637