180730
domain: N
Appears in sequences
- a(n) = a(1) + a(2) + ... + a(n-1) - a(m) for n >= 4, where m = 2^(p+1) + 2 - n and p is the smallest integer such that 2^p < n - 1 <= 2^(p+1), starting with a(1) = 1, a(2) = 2, and a(3) = 3.at n=19A049909
- Number of -n..n arrays x(0..4) of 5 elements with zero sum and no two or three adjacent elements summing to zero.at n=11A200432
- Number of (n+1)X(2+1) 0..3 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=2A237483
- Number of (n+1)X(3+1) 0..3 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=1A237484
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=7A237488
- T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with the maximum plus the minimum minus the lower median of every 2X2 subblock equal.at n=8A237488