35290

Appears in sequences

• a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, s(1) = 1, s(n) = 4, |s(i) - s(i-1)| <= 1 for i >=2, |s(2) - s(1)| = 1, |s(3) - s(2)| = 1 if s(2) = 1. Also a(n) = T(n,n-4), where T is the array in A026268.at n=9A026290
• Number of Z-convex polyominoes with semiperimeter n.at n=10A128611
• Number of n X n binary arrays symmetric under horizontal and vertical reflection with all ones connected only in a 1111-1111 pattern in any orientation.at n=15A146935
• Number of walks within N^3 (the first octant of Z^3) starting at (0,0,0) and consisting of n steps taken from {(-1, 0, 0), (0, -1, 0), (0, 1, 1), (1, 1, -1)}.at n=10A148789
• Number of nondecreasing strings of numbers x(i=1..n) in -3..3 with sum x(i)^3 equal to 0.at n=45A188271
• Lengths of binary representations of prime Fibonacci numbers.at n=31A215367