11160261

Appears in sequences

• a(n) = 7*3^n.at n=13A005032
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*9^j.at n=33A038227
• Triangle whose (i,j)-th entry is binomial(i,j)*3^(i-j)*9^j.at n=34A038227
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*3^j.at n=29A038293
• Triangle whose (i,j)-th entry is binomial(i,j)*9^(i-j)*3^j.at n=30A038293
• 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=28A072985
• Stirling2 triangle with scaled diagonals (powers of 9).at n=31A075504
• Fourth column of triangle A075504.at n=4A076010
• a(n) = (7*3^n - 4*0^n)/3.at n=14A082541
• Expansion of (1-3*x+12*x^2)/((1-3*x)*(1+3*x)).at n=14A091103
• Number of 4-ary Lyndon words of length n with exactly two 1s.at n=12A124810
• a(n) = 3*a(n-1) for n>2; a(0)=1, a(1)=3, a(2)=7.at n=15A141495
• a(n) = 3*a(n-2) for n > 2; a(1) = 1; a(2) = 7.at n=27A166481
• Triangle T(n,k) read by rows: T(n,k) is the number of rooted hypertrees on n labeled vertices with k hyperedges, n >= 2, k >= 1.at n=31A210586
• a(n+2) = 3*a(n), starting 4,7.at n=27A228879
• Number of (n+2) X (1+2) 0..3 arrays with every consecutive three elements in every row and column not having exactly two distinct values, and in every diagonal and antidiagonal having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=36A253018
• Numerators of Bernoulli numbers 3^n*B(n), with B(n) = A027641(n)/A027642(n).at n=14A285863
• The total number of big descents in all parking functions of length n.at n=7A386860