86120
domain: N
Appears in sequences
- Let u(1)=u(2)=1, u(3)=2n, u(k) = abs(u(k-1)-u(k-2)-u(k-3)) and M(k) = Max_{i<=i<=k} u(i), then for any k >= A078109(n), M(k) = floor(sqrt(k + a(n))).at n=35A078108
- Number of (n+1) X (3+1) 0..3 arrays with every 2 X 2 subblock having its diagonal sum differing from its antidiagonal sum by 4 (constant-stress 1 X 1 tilings).at n=13A235284