reviewed
approved
reviewed
approved
proposed
reviewed
editing
proposed
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
Rémy Sigrist, <a href="/A323836/b323836.txt">Rows n = 0..12, flattened</a>
nonn,tabl,more,new
More terms from Rémy Sigrist, Feb 05 2019
approved
editing
editing
approved
Left edge is all 1's, right edge (after initial row) is all 0's; interior entries are concatenations of two numbers above them.
qqqq
The "binary Pascal triangle" read by rows.
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,
...
allocated for N. J. A. Sloane
qqqq
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
0,5
allocated
nonn
N. J. A. Sloane, Feb 04 2019
approved
editing
allocated for N. J. A. Sloane
allocated
approved