A323836 - OEIS

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

(list; table; graph; refs; listen; history; text; internal format)

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, 0,

1, 10, 0,