32336
domain: N
Appears in sequences
- Numbers k such that 2^k + k^3 + 1 is prime.at n=18A100358
- Number of n X 2 0,1 arrays indicating 2 X 2 subblocks of some larger (n+1) X 3 binary array having a sum of one or less, with rows and columns of the latter in lexicographically nondecreasing order.at n=29A227161
- Number of (n+1)X(n+1) 0..2 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock equal.at n=2A237059
- Number of (n+1)X(3+1) 0..2 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock equal.at n=2A237062
- T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with the maximum plus the upper median plus the minimum minus the lower median of every 2X2 subblock equal.at n=12A237067
- Number of identity trees with n nodes where the maximal outdegree (branching factor) equals 8.at n=6A245753
- Number of (n+1) X (2+1) 0..2 arrays with no 2 X 2 subblock having the sum of its diagonal elements greater than the absolute difference of its antidiagonal elements.at n=8A251082
- For n >= 2, a(n) is the number of slim rectangular diagrams of length n.at n=7A273596
- Number of nX7 0..1 arrays with every element equal to 0, 1, 4 or 5 horizontally, diagonally or antidiagonally adjacent elements, with upper left element zero.at n=8A302514
- G.f. A(x,y) = lim_{N->infinity} (1 - P(N,x,y))/(2*x)^N, where P(0,x,y) = -y, and P(n+1,x,y) = sqrt(1 - 4*x + 4*x*P(n,x,y)) for n = 0..N-1.at n=40A352093