200880

Appears in sequences

• Integers with exactly 100 divisors.at n=13A163816
• Triangle S(n,k) by rows: coefficients of 6^((n-1)/2)*(x^(1/6)*d/dx)^n when n is odd, and of 6^(n/2)*(x^(5/6)*d/dx)^n when n is even.at n=39A223172
• Triangle S(n,k) by rows: coefficients of 6^((n-1)/2)*(x^(1/6)*d/dx)^n when n=1,3,5,...at n=19A223531
• Number of (n+1) X (4+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=4A262416
• T(n,k)=Number of (n+1)X(k+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=32A262420
• Number of (5+1)X(n+1) 0..1 arrays with each row divisible by 3 and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=3A262424
• Triangular array read by rows: row n shows the coefficients of the polynomial p(x,n) constructed as in Comments; these polynomials form a strong divisibility sequence.at n=25A327323
• a(n) = product of nonzero entries in row n of A235791.at n=30A339577
• a(n) is the largest denominator when the greedy algorithm for Egyptian fractions is applied to 1/n + 1/(n+1).at n=29A362289