A200147 Number of 0..1 arrays x(0..n-1) of n elements with zero n-1st difference.
1, 2, 2, 4, 2, 8, 2, 16, 6, 32, 2, 64, 2, 144, 14, 256, 2, 512, 2, 1024, 6, 2048, 2, 4096, 50, 8192, 6, 16384, 2, 34816, 2, 66176, 6, 147456, 130, 262168, 2, 524288, 38, 1048576, 2, 2127872, 2, 4194304, 134, 8388608, 2, 17825792, 4098, 33554432, 6, 67108864
Offset: 1
Keywords
Examples
All solutions for n=6 ..0....0....0....1....1....0....1....1 ..0....1....0....1....0....1....0....1 ..1....1....0....0....1....0....0....1 ..1....1....0....0....1....0....0....1 ..0....1....0....1....0....1....0....1 ..0....0....0....1....1....0....1....1
Links
- Eugen J. Ionascu, Bisecting binomial coefficients (II), arXiv preprint arXiv:1712.01243, 2017
- Eugen J. Ionascu, Thor Martinsen, Pantelimon Stanica, Bisecting binomial coefficients, arXiv:1610.02063 [math.CO], 2016. See p. 11.
Crossrefs
Cf. A200154.
Extensions
a(38)-a(52) added from Ionascu link by Michel Marcus, Oct 10 2016
Comments