136384

Appears in sequences

• a(n) = 2*(a(n-1) + a(n-2)), a(0) = 0, a(1) = 1.at n=13A002605
• a(n)*a(n+3) - a(n+1)*a(n+2) = 2^n, given a(0)=1, a(1)=1, a(2)=6.at n=12A080879
• Triangle T(n,k) (n >= 1, 0 <= k <= floor((n-1)/2)) read by rows, where T(n,k) = (k+1)T(n-1,k) + (2n-4k)T(n-1,k-1).at n=32A101280
• a(n) = Sum_{k=0..n} binomial(2n+1, 2k)*3^(n-k).at n=6A102591
• Sylvester cyclotomic numbers for A002605.at n=12A105607
• Sequence arising from the factorization of F(n)=A002605 and L(n)=A080040 F(0)=0, F(1)=1, F(n)=2*F(n-1)+2*F(n-2), L(0)=2, L(1)=2, L(n)=2*L(n-1)+2*L(n-2).at n=25A127259
• Expansion of g.f.: x^2*(1 + x - x^2)/(1 - 2*x^2 - 2*x^4).at n=26A160444
• Elements of A160444, pairs of consecutive entries swapped.at n=27A160572
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=20A232137
• Number of (6+1)X(n+1) 0..2 arrays with no element equal to a strict majority of its horizontal and antidiagonal neighbors, with values 0..2 introduced in row major order.at n=0A232143
• Numbers k such that (62*10^k - 791)/9 is prime.at n=20A293002