135445
domain: N
Appears in sequences
- a(n) = a(n-1)*a(n-3) + a(n-2), with a(0)=a(1)=0 and a(2)=1.at n=14A048634
- Number of n X 4 binary arrays with all 1s connected, all corners 1, and no 1 having more than two 1s adjacent.at n=12A163735
- T(n,k)=Equals two maps: number of nXk binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 nXk array.at n=30A220959
- Equals two maps: number of 3Xn binary arrays indicating the locations of corresponding elements equal to exactly two of their horizontal, diagonal and antidiagonal neighbors in a random 0..3 3Xn array.at n=5A220960
- Number of n X n 0..1 arrays with every element unequal to 0, 1, 2, 4 or 5 king-move adjacent elements, with upper left element zero.at n=5A304340
- Number of nX6 0..1 arrays with every element unequal to 0, 1, 2, 4 or 5 king-move adjacent elements, with upper left element zero.at n=5A304345
- a(n) is the least number k such that A349474(k) = n, or -1 if no such k exists.at n=18A349475