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 #17 Feb 16 2018 18:04:08
%S 1,2,2,4,2,8,2,16,6,32,2,64,2,144,14,256,2,512,2,1024,6,2048,2,4096,
%T 50,8192,6,16384,2,34816,2,66176,6,147456,130,262168,2,524288,38,
%U 1048576,2,2127872,2,4194304,134,8388608,2,17825792,4098,33554432,6,67108864
%N Number of 0..1 arrays x(0..n-1) of n elements with zero n-1st difference.
%C Column 1 of A200154.
%H Eugen J. Ionascu, <a href="https://arxiv.org/abs/1712.01243">Bisecting binomial coefficients (II)</a>, arXiv preprint arXiv:1712.01243, 2017
%H Eugen J. Ionascu, Thor Martinsen, Pantelimon Stanica, <a href="https://arxiv.org/abs/1610.02063">Bisecting binomial coefficients</a>, arXiv:1610.02063 [math.CO], 2016. See p. 11.
%e All solutions for n=6
%e ..0....0....0....1....1....0....1....1
%e ..0....1....0....1....0....1....0....1
%e ..1....1....0....0....1....0....0....1
%e ..1....1....0....0....1....0....0....1
%e ..0....1....0....1....0....1....0....1
%e ..0....0....0....1....1....0....1....1
%Y Cf. A200154.
%K nonn
%O 1,2
%A _R. H. Hardin_, Nov 13 2011
%E a(38)-a(52) added from Ionascu link by _Michel Marcus_, Oct 10 2016