Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #16 Sep 09 2020 11:04:34
%S 1,1,1,2,1,2,3,2,1,4,2,5,4,2,4,3,4,3,5,7,2,7,8,4,7,7,3,7,6,4,10,4,9,7,
%T 4,7,8,11,9,8,5,12,10,13,12,6,9,12,14,5,12,10,10,11,11,8,12,13,10,11,
%U 20,6,16,10,18,11,11,14,10,10,16,9,15,17,13,21
%N a(n) is the number of horizontal segments originating from some grid point on the n-th antidiagonal of the Even Conant lattice.
%C a(n) is the number of k in the range 0..n such that k = 0 or (A337264(n-k, k) = 1 and A337264(n-k, k-1) = 0).
%H Rémy Sigrist, <a href="/A337618/b337618.txt">Table of n, a(n) for n = 0..8191</a>
%H Rémy Sigrist, <a href="/A337618/a337618.png">Illustration of initial terms</a>
%H Rémy Sigrist, <a href="/A337618/a337618_1.png">Colored scatterplot of the first 2^15 terms</a> (where the color is function of the 2-adic valuation of n)
%H Rémy Sigrist, <a href="/A337618/a337618.txt">C++ program for A337618</a>
%e See Links section.
%o (C++) See Links section.
%Y Cf. A328078, A337264, A337619.
%K nonn
%O 0,4
%A _Rémy Sigrist_ and _N. J. A. Sloane_, Sep 08 2020