3472875

Appears in sequences

• Numbers, not ending with 0, that are "printer's errors".at n=4A096298
• a(n) = denominator of r(n): r(n) is such that the continued fraction (of rational terms) [r(1);r(2),...r(n)] equals n! for every positive integer n.at n=9A128524
• Integers n such that if you insert between each of their digits either "*" (times), "^" (exponentiation), or "nothing" (so that two or more digits are merged to form an integer), then you can recover n in a nontrivial way (however, two "^" mustn't be adjacent - you must avoid decompositions containing a^b^c).at n=13A156322
• Numbers with prime factorization p^3*q^3*r^4 where p, q, and r are distinct primes.at n=18A190472
• Odd coreful abundant numbers: the odd terms of A308053.at n=29A339936
• Odd numbers k such that A183097(k) > 2*k.at n=0A349065
• Indices at which A358777 attains a new value.at n=31A359608