32750

Appears in sequences

• Smallest number m such that exactly n editing steps (insert or substitute) are necessary to transform the binary representation of m into the least prime not less than m.at n=13A171402
• a(n) = Sum_{k=1..n} k*lcm(k,k')/gcd(k,k'), where k' is arithmetic derivative of k.at n=28A190122
• p-INVERT of (1,1,0,0,0,0,...), where p(S) = (1 - 5 S)^2.at n=4A291389
• a(n) = Sum_{k=1..n} k^2*tau_3(k), where tau_3 is A007425.at n=20A319088
• The smallest of 3 consecutive integers such that the first is divisible by the square of a prime, the second is divisible by the cube of a prime, and the third is divisible by the fourth power of a prime.at n=23A349952
• Number of irreducible permutations of n with partition type [2, 1, 1, ..., 1] (with '1' taken n - 2 times).at n=15A356114