44019

Appears in sequences

• a(n) = a(n-1) + 2*a(floor(n/2)) if n > 0, otherwise 1.at n=37A058039
• Triangle read by rows: T(n,k) is the number of weighted lattice paths in L_n having k (1,-1)-returns to the horizontal axis. The members of L_n are paths of weight n that start at (0,0), end on the horizontal axis and whose steps are of the following four kinds: an (1,0)-step with weight 1, an (1,0)-step with weight 2, a (1,1)-step with weight 2, and a (1,-1)-step with weight 1. The weight of a path is the sum of the weights of its steps.at n=41A182896
• Number of (2+1) X (n+1) 0..2 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing min(x(i,j),x(i-1,j)) in the j direction.at n=11A250814
• Number of integer partitions of n with no difference -2.at n=46A350842
• Arises from enumeration of a certain class of zig-zag knight's paths on the square grid.at n=28A368376