264300

Appears in sequences

• a(n) = 2*a(n-1) + a(n-3), with a(0)=1 and a(1)=2.at n=16A008998
• Pisot sequences E(4,9), P(4,9).at n=14A020708
• Number of defective 3-colorings of an n X 7 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=2A229585
• T(n,k) = number of defective 3-colorings of an n X k 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=38A229586
• Number of defective 3-colorings of a 3 X n 0..2 array connected horizontally and antidiagonally with exactly one mistake, and colors introduced in row-major 0..2 order.at n=6A229588
• Number of 3 X n 0..1 arrays with no element equal to fewer vertical neighbors than horizontal neighbors, with new values 0..1 introduced in row major order.at n=14A240784
• Expansion of x^2/(1 - 4*x - 4*x^2 - x^3).at n=10A293710
• Irregular triangle read by rows: T(n, k) is the number of chains of subspaces 0 < V_1 < ... < V_r = (F_4)^n, counted up to coordinate permutation, with dimension increments given by (any fixed permutation of) the parts of the k-th partition of n in Abramowitz-Stegun order.at n=26A348115