33030144

Appears in sequences

• Number of divisors of k as k runs through sequence of distinct values of LCM(1,..,n).at n=30A056795
• a(1) = 1; a(n) is the smallest multiple of a(n-1) not divisible by 10 which is greater than the digit reversal of a(n-1). In case R(a(n-1)) < a(n-1) then a(n) = 2*a(n-1).at n=19A076086
• a(n) = floor(2^(n-2)*3*n).at n=20A128543
• a(n) = (n^3 - n)*4^n.at n=7A128962
• Triangle T(n, k) = (n-k)^n * binomial(n, n-k) for n < 2*k, k^n * binomial(n, k) for n >= 2*k with T(n, 0) = T(n, n) = 1, read by rows.at n=49A167040
• Triangle T(n, k) = (n-k)^n * binomial(n, n-k) for n < 2*k, k^n * binomial(n, k) for n >= 2*k with T(n, 0) = T(n, n) = 1, read by rows.at n=50A167040
• Number of n X 3 0..1 arrays with no element equal to more than one of its horizontal and antidiagonal neighbors, with the exception of exactly one element, and with new values introduced in order 0 sequentially upwards.at n=18A281200
• a(n) is the number of numbers whose largest prime power factor equals A000961(n).at n=31A305215
• Numbers that can be written in two or more ways as the product of three divisors greater than 1 such that the number in binary is contained in the string concatenation of the divisors in binary.at n=34A356143