338690048

Appears in sequences

• a(n) = T(n,2), array T as in A049600.at n=23A049611
• a(n) = 2*a(n-1) + 4*a(n-2), a(0)=1, a(1)=2.at n=17A063727
• Binomial transform of binomial(n+2,2).at n=22A084851
• Horadam sequence (0,1,4,2).at n=18A085449
• Number of 4 X n binary matrices avoiding simultaneously the right angled numbered polyomino patterns (ranpp) (10;0) and (01;1).at n=17A100313
• a(1) = 1, a(n) = 2*a(n-1) if n is even; a(n) = a(n-1)*Fibonacci((n+1)/2)/Fibonacci((n-1)/2) if n is odd.at n=34A171648