A323836 The "binary Pascal triangle" read by rows.

1, 1, 0, 1, 10, 0, 1, 110, 100, 0, 1, 1110, 110100, 1000, 0, 1, 11110, 1110110100, 1101001000, 10000, 0, 1, 111110, 111101110110100, 11101101001101001000, 110100100010000, 100000, 0, 1, 1111110, 111110111101110110100, 11110111011010011101101001101001000

Offset

0,5

Comments

Left edge is all 1's, right edge (after initial row) is all 0's; interior entries are concatenations of two numbers above them.

Links

Rémy Sigrist, Rows n = 0..12, flattened

J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.

Example

Triangle begins:
1,
1, 0,
1, 10, 0,
1, 110, 100, 0,
1, 1110, 110100, 1000, 0,
1, 11110, 1110110100, 1101001000, 10000, 0,
1, 111110, 111101110110100, 11101101001101001000, 110100100010000, 100000, 0,
...

Crossrefs

Cf. A007318, A323837.

Sequence in context: A367508 A221809 A291451 * A365893 A062520 A157962

Adjacent sequences: A323833 A323834 A323835 * A323837 A323838 A323839

Keyword

nonn,tabl

Author

N. J. A. Sloane, Feb 04 2019

Extensions

More terms from Rémy Sigrist, Feb 05 2019

Status

approved