1595052

Appears in sequences

• a(n) = (3^n + 2*3^(n/2)*cos(n*Pi/6))/3.at n=14A092236
• Binomial transform of A131666.at n=15A135254
• Number of (n+1) X (1+1) 0..4 arrays with each row and column divisible by 9, read as a base-5 number with top and left being the most significant digits.at n=13A263375
• a(1) = 2, a(2) = 4, a(3) = 6; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).at n=13A318609
• a(1) = 0, a(2) = 4, a(3) = 12; for n > 3, a(n) = 3*a(n-1) - 3*a(n-2) + 9*a(n-3).at n=13A318610
• a(n) is the number of words of length n on the alphabet {0,1,2} with the number of 0's plus the number of 1's congruent to the number of 2's modulo 3.at n=14A334656