124740

Appears in sequences

• A convolution triangle of numbers generalizing Pascal's triangle A007318.at n=41A049327
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=23A059436
• Smallest number whose set of divisors contains each digit 0-9 at least n times.at n=24A059436
• A convolution triangle of numbers obtained from A034789.at n=17A092083
• Number of partitions of n times number of divisors of n.at n=38A141667
• Numbers with exactly 5 distinct prime divisors {2,3,5,7,11}.at n=35A147572
• Smallest size of which there are n tatami-free rooms.at n=26A165764
• Table, read by rows, of the number of quivers of affine type A_(n-1) according to the parameter k (n >= 2, 1 <= k <= [n/2]).at n=40A189942
• Numbers with prime factorization pqrs^2t^4.at n=8A190384
• A double factorial triangle.at n=30A193229
• Number of (n+2) X 7 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=6A202458
• Number of (n+2) X 9 binary arrays with consecutive windows of three bits considered as a binary number nondecreasing in every row and column.at n=4A202460
• Triangle S(n, k) by rows: coefficients of 2^((n-1)/2)*(x^(1/2)*d/dx)^n when n is odd, and of 2^(n/2)*(x^(1/2)*d/dx)^n when n is even.at n=42A223168
• Triangle S(n, k) by rows: coefficients of 2^(n/2)*(x^(1/2)*d/dx)^n, where n =0, 2, 4, 6, ...at n=22A223524
• Non-repdigit numbers k that divide A045876(k).at n=25A276413
• a(n) = 4*p(n), where p(n) is the number of partitions of n.at n=39A299474
• Nonzero coefficients of the polynomials (x + d/dx)^n x^2, in row-major order.at n=46A330209
• Nonzero coefficients of the polynomials (x + d/dx)^n x^2, in row-major order.at n=53A330209
• a(n) is the smallest number that has exactly n divisors that are digitally balanced numbers (A031443).at n=23A357035
• a(n) is the first number with a total of exactly n 3's in the decimal digits of its divisors.at n=35A387464