28654

Appears in sequences

• a(n) = Fibonacci(n) - 3. Number of total preorders.at n=19A006327
• a(n) = a(1)*a(n-1) + a(2)*a(n-2) + ...+ a(n-1)*a(1) for n >= 5, starting 1,1,1,0.at n=13A025274
• Site percolation series for Kagome lattice.at n=25A120549
• 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, -1, 1), (-1, 1, -1), (-1, 1, 1), (1, -1, 0), (1, 0, 0)}.at n=10A148276
• Number of length n left factors of Dyck paths having no base pyramids.at n=18A191789
• Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..6 array extended with zeros and convolved with 1,1,1.at n=21A222436
• Number of nX5 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=3A240282
• T(n,k)=Number of nXk 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=31A240284
• Number of 4Xn 0..3 arrays with no element equal to one plus the sum of elements to its left or two plus the sum of the elements above it or zero plus the sum of the elements diagonally to its northwest, modulo 4.at n=4A240287
• a(n) = (Fibonacci(n+2)-1) mod Fibonacci(floor(n/2)).at n=45A270741