46875

Appears in sequences

• Numbers that are the sum of 3 nonzero 6th powers.at n=37A003359
• Numbers of the form 3^i*5^j with i, j >= 0.at n=40A003593
• Expansion of g.f. (1 - 2*x)/(1 - 5*x).at n=7A005053
• Smallest label f(T) given to a rooted tree T with n nodes in Matula-Goebel labeling.at n=20A005517
• Numbers whose prime factors are 3 and 5.at n=24A033849
• a(n) = 5^(n/2) for n even, a(n) = 3*5^((n-1)/2) for n odd.at n=13A056487
• Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.at n=9A064562
• The terms of A055237 (sums of two powers of 5) divided by 2.at n=34A073217
• a(n) = (4*5^n + (-5)^n)/5.at n=7A083222
• Duplicate of A083222.at n=7A083298
• Numbers k such that k divides the concatenation of all divisors of k in ascending order other than 1 and k itself.at n=5A088376
• Least number k such that k! in binary representation contains a run of exactly n consecutive nontrivial zeros.at n=30A094010
• Expansion of (1 + 3x - 2x^2 - 12x^3)/(1 - 9x^2 + 20x^4).at n=13A097111
• Numbers n that are the hypotenuse of exactly 6 distinct integer-sided right triangles, i.e., n^2 can be written as a sum of two squares in 6 ways.at n=2A097219
• Table read by antidiagonals of least integer "mod 4 prime signatures" k ordered by number of Pythagorean triples with hypotenuse = k.at n=42A097753
• Triangle, read by rows, of Stirling numbers of first kind, S1(n,k), multiplied by k^k, for n >= 1, 1<=k<=n.at n=19A105196
• Triangle, read by rows, of Stirling numbers of second kind, S2(n,k), multiplied by k^k, for n >= 1, 1<=k<=n.at n=19A105197
• a(n) = (n^(n+1))*(n + 1)/2 = A000217(n)*A000312(n).at n=5A109391
• a(1) = 1, a(2) = 3; for n >= 3, take a(n) to be the smallest odd number not occurring earlier such that a(n-1) divides the concatenation a(n-2)a(n).at n=13A111386
• a(n) = 3*n^3.at n=25A117642