28565
domain: N
Appears in sequences
- Numbers k such that k!!! + 1 is prime (0 is included by convention).at n=42A037083
- a(n) = n^4+4 = (n^2-2*n+2)*(n^2+2*n+2) = ((n-1)^2+1)*((n+1)^2+1).at n=13A057781
- 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, 0), (-1, -1, 1), (-1, 1, -1), (1, 0, 0), (1, 0, 1)}.at n=9A149875
- a(n) = 54*n^2 - 1.at n=22A158656
- Number of binary arrays indicating the locations of trailing edge maxima of a random length-n 0..4 array extended with zeros and convolved with 1,-2,1.at n=18A222149
- Numbers k such that k^2*2^k + 3 is prime.at n=22A259298
- a(n) = 225*2^n - 235.at n=7A278125
- a(n) = (1 + Sum_{j=1..K-2} a(n-j)*a(n-j-1))/a(n-K) with a(1),...,a(K)=1, where K=6.at n=10A283918
- Number of nX3 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1s.at n=6A297757
- T(n,k)=Number of nXk 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1s.at n=42A297762
- Number of 7Xn 0..1 arrays with every 1 horizontally, diagonally or antidiagonally adjacent to 2, 3 or 4 neighboring 1s.at n=2A297768