37125

Appears in sequences

• Determinant of the n X n matrix whose element (i,j) equals t(|i-j|) where t(n) is the number of divisors of n and t(0) = 0.at n=11A071084
• Numbers k divisible by at least one nontrivial permutation (rearrangement) of the digits of k, excluding all permutations that result in digit loss.at n=9A090056
• a(n) = (n+1)^2*(n+2)^3*(n+3)/24.at n=8A108648
• Odd infinitary abundant numbers.at n=28A127666
• Number of partitions p = [x(1), ..., x(k)], where x(1) >= x(2) >= ... >= x(k), of n such that max(x(i) - x(i-1)) <= number of parts of p.at n=41A241829
• Successive integers produced by Conway's PRIMEGAME, starting with 12 rather than 2.at n=3A273099
• Number of ordered set partitions of [n] into nine blocks such that equal-sized blocks are ordered with increasing least elements.at n=2A285924
• Odd bi-unitary abundant numbers: odd numbers k such that bsigma(k) > 2*k, where bsigma is the sum of the bi-unitary divisors function (A188999).at n=32A293186
• a(n) = ord(2,A006935(n)/2), where ord(k,m) is the multiplicative order of k modulo m.at n=32A350084
• Odd numbers k such that A162296(k) > 2*k.at n=21A357607
• Numbers k such that A360327(k) > 2*k.at n=4A360328
• Smallest number sharing n distinct (decimal) digits with its largest proper divisor.at n=4A362675
• a(n) = A276086(1+n) - A276086(A001065(n)), where A276086 is the primorial base exp-function, and A001065 is the sum of proper divisors of n.at n=56A379498
• Odd numbers k such that gcd(A276086(sigma(k)-k), A276086(k)) is equal to A276086(k), where A276086 is the primorial base exp-function, and sigma is the sum of divisors function.at n=24A388267