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

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)

Prog

(MIT Scheme:) (define (A179758 n) (modulo (floor->exact (/ (A080069 (A000194 n)) (expt 2 (A179753 n)))) 2))

Crossrefs

Cf. also A179759 & A179761-A179763.

Sequence in context: A361122 A193497 A260390 * A287795 A267704 A174888

Adjacent sequences: A179755 A179756 A179757 * A179759 A179760 A179761

Keyword

nonn,tabf

Author

Antti Karttunen, Aug 03 2010

Status

approved