703125

Appears in sequences

• Smallest label f(T) given to a rooted tree T with n nodes in Matula-Goebel labeling.at n=25A005517
• Numbers of form 5^i*9^j, with i, j >= 0.at n=33A025624
• Reciprocal of n terminates with an infinite repetition of digit 2. Multiples of 10 are omitted.at n=3A064561
• Numbers such that each of the first 2j primes appears exactly once in the prime factorization, either as factor or exponent.at n=13A114132
• Numbers with prime signature {7,2}, i.e., of form p^7*q^2 with p and q distinct primes.at n=27A179689
• Number of nX3 array permutations with each element not moved or moved diagonally or antidiagonally by one.at n=8A189274
• Number of (n+1)X8 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=0A203834
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=21A203835
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having equal diagonal elements or equal antidiagonal elements.at n=27A203835
• Expansion of g.f. (1+4*x)/(1-5*x).at n=8A270567
• Numbers such that (sum + product) of all their prime factors equals (sum + product) of all exponents in their prime factorization.at n=35A272818
• Numbers m such that Product(1 + p_i) = Product(1 + e_i), where m = Product((p_i)^e_i).at n=42A272858
• Numbers m such that sigma(Product(p_j)) = sigma(Product(e_j)), where m = Product((p_i)^e_i) and sigma = A000203.at n=38A272859
• Number of set partitions of [n] such that i-j is a multiple of seven for all i,j belonging to the same block.at n=23A275074
• a(n) is the least start of a run of exactly n consecutive powerful numbers (A001694) that are odd, or -1 if no such run exists.at n=3A363192