3188646

Appears in sequences

• Expansion of bracket function.at n=26A000748
• a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=41A000792
• Losing initial configurations in 2-hole Tchuka Ruma.at n=31A007780
• Pisot sequences E(2,6), L(2,6), P(2,6), T(2,6).at n=13A008776
• Numbers n such that n divides n-th Lucas number A000032(n).at n=24A016089
• a(0)=1; a(n) = 2*3^(n-1) for n >= 1.at n=14A025192
• Numbers of form 6^i*9^j, with i, j >= 0.at n=36A025628
• a(n) = Sum_{k=0..m} (k+1) * A026148(n, m-k), where m=0 for n=1; m=n+1 for n >= 2.at n=13A027334
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*9^j.at n=26A038299
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*9^j.at n=22A038299
• a(2n) = 3^n, a(2n+1) = 2*3^n.at n=27A038754
• Next-to-last diagonal of A024462.at n=13A038765
• a(1) = 9; a(n+1) = a(n) * sum of decimal digits of a(n).at n=5A047901
• a(1) = 3; for n > 0, a(n+1) = a(n) * sum of digits of a(n).at n=6A047912
• Scaled Chebyshev U-polynomials evaluated at sqrt(3)/2; expansion of 1/(1 - 3*x + 3*x^2).at n=26A057083
• Number of n-step walks (each step +-1 starting from 0) which are never more than 2 or less than -2.at n=27A068911
• Coefficient of the highest power of q in the expansion of nu(0)=1, nu(1)=b and for n >= 2, nu(n) = b*nu(n-1) + lambda*(n-1)_q*nu(n-2) with (b,lambda)=(2,3), where (n)_q = (1+q+...+q^(n-1)) and q is a root of unity.at n=27A072985
• Expansion of (1+2*x+6*x^2)/(1-9*x^3).at n=20A076738
• a(n) = 2^A066657(n) * 3^A066658(n).at n=22A076941
• Largest term in periodic part of continued fraction expansion of square root of 1+3^n or 0 if 1+3^n is square.at n=25A077626