|
%I #11 Sep 09 2020 17:21:00
%S 0,0,0,0,0,0,0,1,1,1,0,1,0,1,2,1,1,2,2,1,1,1,1,1,1,1,1,2,3,3,2,2,1,2,
%T 3,4,4,3,2,1,2,2,2,1,1,1,2,1,1,2,2,1,2,2,3,4,5,5,5,5,4,4,4,3,2,2,3,4,
%U 5,6,7,8,8,7,6,5,4,3,2,3,4,4,4,4,4,3,2
%N a(n) is the length of the largest run of contiguous grid points on the n-th antidiagonal of the Even Conant lattice that are not on an edge, or 0 if no such point exists.
%H Rémy Sigrist, <a href="/A337621/b337621.txt">Table of n, a(n) for n = 0..8191</a>
%H Rémy Sigrist, <a href="/A337621/a337621_1.png">Illustration of initial terms</a>
%H Rémy Sigrist, <a href="/A337621/a337621.png">Scatterplot of the first 2^15 terms</a>
%H Rémy Sigrist, <a href="/A337621/a337621.txt">C++ program for A337621</a>
%F a(n) <= A337620(n).
%F Apparently, abs(a(2*n) - 2*a(n)) <= 1.
%e See Links section.
%o (C++) See Links section.
%Y Cf. A328078, A337620, A337622.
%K nonn,look
%O 0,15
%A _Rémy Sigrist_, Sep 09 2020
|
