110187
domain: N
Appears in sequences
- a(n) = T(2n-1,n-1), where T is the array in A026120.at n=7A026127
- Number of (n+1) X (1+1) 0..2 arrays with nondecreasing max(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=6A250585
- Number of (n+1)X(7+1) 0..2 arrays with nondecreasing max(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=0A250591
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing max(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=21A250592
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with nondecreasing max(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=27A250592
- a(n) = Sum_{k=1..n} k^2*Bernoulli(k-1)*C(2*n-1,k)*Stirling2(2*n-k,n).at n=5A256018
- Numbers k such that k*A001414(k)+1 is the square of a prime.at n=41A343141