3515625

Appears in sequences

• Smallest label f(T) given to a rooted tree T with n nodes in Matula-Goebel labeling.at n=28A005517
• Triangle of coefficients in expansion of (1+5x)^n.at n=53A013612
• a(n) = Sum_{k=0..n} (k+1) * T(n,k), with T given by A026374.at n=16A026950
• n in base 8 is a palindromic square.at n=24A029806
• Triangle whose (i,j)-th entry is 5^(i-j)*binomial(i,j).at n=46A038243
• a(n) = n*5^(n-1).at n=9A053464
• Reciprocal of n terminates with an infinite repetition of digit 4. Multiples of 10 are omitted.at n=4A064563
• Numbers not ending in 0 which are the product of two substrings of themselves. The substrings may be equal, but each must be greater than 1.at n=26A066217
• Numbers k such that k is a square and remains a square when its leading digit is increased by one.at n=8A067225
• Triangle with columns built from certain power sequences.at n=49A067402
• Fifth column of triangle A067402.at n=5A067405
• Treated as strings, the concatenation c of the prime factors of n, in increasing order, is an initial segment of n. Equivalently, n begins with c.at n=25A069154
• a(n) = (2*n+1)*25^n.at n=4A166725
• Number of nX3 array permutations with each element not moved or moved diagonally or antidiagonally by one.at n=9A189274
• 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=28A203835
• Number of n X 6 0..1 arrays avoiding 0 0 0 and 0 1 0 horizontally and 0 0 1 and 1 1 0 vertically.at n=11A207701
• Expansion of g.f. (1+4*x)/(1-5*x).at n=9A270567
• Number of set partitions of [n] such that i-j is a multiple of eight for all i,j belonging to the same block.at n=26A275075
• Numbers n such that n^3-1 is a sum of cubes in 1 way and a difference of cubes in 2 ways.at n=34A281789
• Hypotenuses for which there exist exactly 8 distinct integer triangles.at n=7A290499