100462

Appears in sequences

• a(n) is the smallest squarefree semiprime that belongs to a sequence of length n under repeated iteration of the map (k -> concatenation of prime divisors of k in increasing order) until a number is reached that is not a squarefree semiprime.at n=10A243843
• Number of (n+1)X(1+1) 0..3 arrays with no 2X2 subblock having the minimum of its diagonal elements less than the absolute difference of its antidiagonal elements.at n=3A251168
• Number of (n+1)X(4+1) 0..3 arrays with no 2X2 subblock having the minimum of its diagonal elements less than the absolute difference of its antidiagonal elements.at n=0A251171
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having the minimum of its diagonal elements less than the absolute difference of its antidiagonal elements.at n=6A251175
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with no 2X2 subblock having the minimum of its diagonal elements less than the absolute difference of its antidiagonal elements.at n=9A251175
• a(n) is the smallest index k such that Sum_{m=1..k} 1/z(m) > n where z(m) is the imaginary part of the m-th nontrivial zero of the Riemann zeta function, n=0,1,2,...at n=7A332614
• Table read by row, where T(n,k), n>0 and k>0, represents the smallest n-digit number that is the product of k distinct primes and is sandwiched between semiprime numbers, or -1 if no such number exists.at n=19A379167