29296875

Appears in sequences

• Expansion of g.f. (1 - 2*x)/(1 - 5*x).at n=11A005053
• Smallest label f(T) given to a rooted tree T with n nodes in Matula-Goebel labeling.at n=32A005517
• a(n) = 5^(n/2) for n even, a(n) = 3*5^((n-1)/2) for n odd.at n=21A056487
• Reciprocal of n terminates with an infinite repetition of digit 3. Multiples of 10 are omitted.at n=16A064562
• a(n) = det(M(n)) where M(n) is the n X n matrix defined by m(i,i)=6, m(i,j)=i/j.at n=9A079027
• 5th binomial transform of (1,1,0,0,0,0,.....).at n=10A081105
• a(n) = (4*5^n + (-5)^n)/5.at n=11A083222
• Duplicate of A083222.at n=11A083298
• Numbers k such that k divides the concatenation of all divisors of k in ascending order other than 1 and k itself.at n=9A088376
• Expansion of (1 + 3x - 2x^2 - 12x^3)/(1 - 9x^2 + 20x^4).at n=21A097111
• 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=21A111386
• a(3*n) = 3*a(3*n-1)-3*a(3*n-2)+2*a(3*n-3), a(3*n+1) = 3*a(3*n)-3*a(3*n-1)+2*a(3*n-2), a(3*n+2) = 3*a(3*n+1)-3*a(3*n) with a(0)=1, a(1)=2, a(2)=3.at n=32A133335
• a(n) = 5*a(n-2) for n > 2; a(1) = 3, a(2) = 5.at n=20A163114
• a(n) = n^10*(n + 1)/2.at n=5A170793
• Expansion of 1/(1-x*sqrt(4*x^2+1)-2*x^2).at n=22A249512
• Number of set partitions of [n] such that i-j is a multiple of ten for all i,j belonging to the same block.at n=31A275077