898909

Appears in sequences

• a(n) = number of (s(0), s(1), ..., s(2*n-1)) such that s(i) is a nonnegative integer and |s(i) - s(i-1)| = 1 for i = 1,2,...,n, s(0) = 2, s(2*n-1) = 5. Also a(n) = T(2*n-1,n-2), where T is the array defined in A026009.at n=10A026017
• Numbers such that the sum of the squares of the largest and the smallest prime divisor equals the sum of the squares of the other distinct prime divisors.at n=24A199857
• a(n) = n!/d where d = A336616(n) is the maximum divisor of n! with distinct prime multiplicities.at n=29A336617
• a(n) = n!/d where d = A336616(n) is the maximum divisor of n! with distinct prime multiplicities.at n=30A336617