32870

Appears in sequences

• a(n) = number of special odd permutations of 2*n+1.at n=5A003110
• Triangular array generated by its row sums: T(n,0)=1 for n >= 0, T(1,1)=2, T(n,k)=T(n,k-1)+d*r(n-k) for k=2,3,...,n, d=(-1)^(k+1), n >= 2, r(h)=sum of the numbers in row h of T.at n=51A054098
• T(n,n-3), array T as in A054098.at n=6A054103
• Triangle read by rows: T(n,k) = number of peakless Motzkin paths of length n and having k weak ascents (1 <= k <= ceiling(n/3)).at n=47A114711
• Numbers n such that Lucas(prime(n)) is prime, where Lucas = A000032.at n=49A120561
• Triangle read by rows: T(n,k) is the number of paths in the first quadrant from (0,0) to (n,0), consisting of steps U=(1,1), D=(1,-1), h=(1,0) and H=(2,0), having k U steps (0 <= k <= floor(n/2)).at n=51A132883
• Number of stacks of odd length in all 2ndary structures of size n.at n=14A202846
• Number of (n+1) X (6+1) 0..1 arrays with nondecreasing x(i,j)-x(i,j-1) in the i direction and nondecreasing x(i,j)-x(i-1,j) in the j direction.at n=7A250609
• a(n) = binomial(n,2)*(binomial(n-1,2) + 2).at n=19A352405
• List of free 4-dimensional polyhypercubes in binary code (see A365139), ordered first by the number of cells, then by the value of the binary code.at n=27A365140