354294

Appears in sequences

• a(n) = max{(n - i)*a(i) : i < n}; a(0) = 1.at n=35A000792
• Numbers that are the sum of 6 positive 10th powers.at n=27A004806
• Numbers that are the sum of 2 positive 11th powers.at n=5A004813
• Numbers that are the sum of at most 2 positive 11th powers.at n=9A004908
• Numbers that are the sum of at most 3 positive 11th powers.at n=16A004909
• Numbers that are the sum of at most 4 positive 11th powers.at n=25A004910
• Numbers that are the sum of at most 5 positive 11th powers.at n=36A004911
• Losing initial configurations in 2-hole Tchuka Ruma.at n=27A007780
• Pisot sequences E(2,6), L(2,6), P(2,6), T(2,6).at n=11A008776
• Triangle of coefficients in expansion of (1+9x)^n.at n=26A013616
• Numbers n such that n divides n-th Lucas number A000032(n).at n=17A016089
• a(0)=1; a(n) = 2*3^(n-1) for n >= 1.at n=12A025192
• Numbers of form 6^i*9^j, with i, j >= 0.at n=27A025628
• 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=11A027334
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*1^j.at n=22A038291
• a(2n) = 3^n, a(2n+1) = 2*3^n.at n=23A038754
• a(n) = n*9^(n-1).at n=5A053540
• a(n) = Sum_{j=0..floor(n/3)} (-1)^j*binomial(n,3*j).at n=24A057681
• Number of n-step walks (each step +-1 starting from 0) which are never more than 2 or less than -2.at n=23A068911
• 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=23A072985