29607
domain: N
Appears in sequences
- Numbers k such that k and 5*k, taken together, are pandigital.at n=32A115925
- Numbers k = p*q*r (p, q, r prime) congruent to 0 mod p+q+r.at n=30A160394
- Number of ordered triples (w,x,y) with all terms in {1,...,n} and w^2+x^2+y^2>=2n.at n=31A211645
- The number of 3-length segments in all possible covers of L-length line by these segments with allowed gaps < 3.at n=31A228494
- Number of (n+2)X(4+2) 0..1 arrays with every 3X3 subblock sum of the two sums of the diagonal and antidiagonal minus the two minimums of the central column and central row nondecreasing horizontally, vertically and ne-to-sw antidiagonally.at n=12A254903
- Products of three distinct primes that form an arithmetic progression.at n=28A262723
- Numbers x that are equal to lpf(x)*gpf(x)*(lpf(x)+gpf(x))/2, where lpf(x) < gpf(x) are the least and the greatest prime factors of x: A020639 and A006530.at n=32A307108
- Numbers x that are equal to lpf(x)*gpf(x)*(lpf(x)+gpf(x))/2, where lpf(x) and gpf(x) are the least and the greatest prime factors of x: A020639 and A006530.at n=42A307117
- Odd squarefree composite numbers k, divisible by the sum of their prime factors, sopfr (A001414).at n=20A308643
- Number of primitive (period n) n-bead bracelet structures which are not periodic palindromes using a maximum of four different colored beads.at n=11A328658
- a(n) is the largest integer x such that x/sopf(x) = prime(n) where sopf(x) is the sum of distinct prime factors of x and prime(n) is the n-th prime.at n=33A336493
- Irregular triangle read by rows: coefficients of polynomials xi_n.at n=17A343171
- Numbers m such that sigma(m) = tau(m)! where sigma(k) = A000203(k) and tau(k) = A000005(k).at n=17A351866
- Numbers of the form prime(w)*prime(x)*prime(y) with w >= x >= y such that 2w = 3x + 4y.at n=36A358102