A179758 Binary expansions of A080069 (A080070) concatenated together to a single binary sequence, so that from each term of A080069, the most significant bits come before the least significant bits.

1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 1, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0

Offset: 1

Author

Antti Karttunen, Aug 03 2010

Keywords

• nonn
• tabf

Comments

When viewed as a table, the first row contains two terms, the second four, the third six, and so on, i.e. row n contains 2n terms.

Links

• A. Karttunen, Table of n, a(n) for n = 1..262656 (containing 512 first rows)

Crossrefs

Cf. also A179759 & A179761-A179763.