222870

Appears in sequences

• Largest squarefree number dividing n-th central binomial coefficient C(n,[ n/2 ]).at n=26A048633
• Largest squarefree number dividing n-th central binomial coefficient C(n,[ n/2 ]).at n=27A048633
• Numbers n such that sum of distinct primes dividing n is divisible by the largest prime dividing n. Also n has exactly 6 distinct prime factors and n is squarefree.at n=3A071145
• Integers which have more than one coprime factorization into nonprime powers which sum to the same number.at n=27A072940
• Largest squarefree number dividing central binomial coefficient A000984(n).at n=14A080397
• a(n) = lcm(1, 2, ..., 2n) / lcm(1, 2, ..., n).at n=14A093880
• Smallest positive number of "triangular" shuffles of n(n+1)/2 cards needed to restore them to their original order.at n=15A122158
• Numbers k such that 2*k+1, 4*k+1, 8*k+1, 16*k+1 and 32*k+1 are primes.at n=25A124413
• Numbers k such that 2*k+1, 4*k+1, 8*k+1, 16*k+1, 32*k+1 and 64*k+1 are primes.at n=5A124414
• The radical of the swinging factorial A056040.at n=28A163641
• Numbers k such that the sum of the distinct prime divisors of k equals three times the largest prime divisor of k.at n=20A200090
• The radical of the Catalan number which is the largest squarefree number dividing binomial(2*n,n)/(n+1).at n=14A281594
• Number of coalescent histories for pseudocaterpillar gene trees G and caterpillar species trees S.at n=9A306423
• a(n) = product of primes p such that p^k <= n < 2*p^k for some k >= 1.at n=27A366369
• a(n) = product of primes p such that p^k <= n < 2*p^k for some k >= 1.at n=28A366369
• Numbers such that the sum of prime factors without repetition divides the product of prime factors without repetition and each division yields a greater quotient.at n=31A380487