28651

Appears in sequences

• Numbers n such that digits of n and the prime factorization of n are distinct and nonrepeating.at n=31A057885
• Smallest positive k such that phi(2n*k+1) < phi(2n*k), where phi is Euler's totient function.at n=6A090851
• Numbers that together with their prime factors contain every digit exactly once.at n=1A124668
• a(1) = 3, a(n + 1) = 1 + a(n) + least odd prime factor of a(n).at n=31A144751
• Number of planar n X n X n binary triangular grids symmetric under 120 degree rotation with no more than 8 ones in any 4 X 4 X 4 subtriangle.at n=9A153959
• Numbers k which use half of the ten digits such that they have at least one factorization k=p*q that uses remaining half of the digits that are not in k.at n=13A195814
• Number of partitions of n containing at least one part m-10 if m is the largest part.at n=36A212550
• Numbers n such that 5^n + 8 is prime.at n=4A217133
• Numbers n = p * q, where n, p, and q together contain all 10 digits at least once.at n=19A253172
• Values n, where n = p * q, and n, p, and q together contain all 10 digits at least once, and no digit is in more than one of n, p or q.at n=13A253173
• List of base-ten k-balanced factorization integers: The combined digits of an integer and its factorization primes and exponents contain exactly k copies of each of the ten digits, for some k.at n=1A273260
• Numbers k which have a factorization k = f1*f2*...*fr where the digits of {k, f1, f2, ..., fr} together give 0,1,...,9 exactly once.at n=30A370970
• Numbers k which have a factorization k = f_1*f_2*...*f_r where f_i >= 1 and the digits of {k, f_1, f_2, ..., f_r} together give 0,1,...,9 exactly once.at n=46A372259