34375

Appears in sequences

• Numbers of the form 5^i * 11^j.at n=20A003598
• Numbers k that divide s(k), where s(1)=1, s(j)=11*s(j-1)+j.at n=13A014858
• Ordered sequence of distinct terms of the form floor(x^i * floor(x^j)), i,j >= 0, where x = sqrt(5).at n=42A022770
• Composite numbers whose prime factors contain no digits other than 1 and 5.at n=29A036305
• Triangle whose (i,j)-th entry is binomial(i,j)*5^(i-j)*11^j.at n=16A038253
• Triangle whose (i,j)-th entry is binomial(i,j)*11^(i-j)*5^j.at n=19A038319
• Row sums of convolution triangle A030523.at n=8A039717
• Numbers k that divide 3^k + 2^k.at n=18A045576
• Numbers k that divide 7^k + 3^k.at n=33A045586
• Numbers k that divide 6^k + 4^k.at n=42A045591
• Numbers k such that k | 10^k + 9^k + 8^k + 7^k + 6^k + 5^k + 4^k + 3^k + 2^k + 1^k.at n=26A056739
• 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=5A079027
• 5th binomial transform of (1,1,0,0,0,0,.....).at n=6A081105
• Hypotenuses for which there exist exactly 5 distinct Pythagorean triangles.at n=8A084649
• Square array, read by antidiagonals, where the n-th row is the n-th binomial transform of the natural numbers, with T(0,k) = (k+1) for k>=0.at n=59A089944
• Number of clique-separable perfect graphs on n nodes.at n=8A123414
• a(n) = 5^n*Lucas(n), where Lucas = A000204.at n=4A127212
• The n-th arithmetic derivative of 5^6.at n=2A129152
• Multiply sequence A007775 (1 7 11 13 ...) by sequence A000351 (1 5 25 125 ...).at n=33A135766
• a(0)=1; a(1)=5; a(2)=11; a(n)=a(1)*a(n-1).at n=7A141496