login
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.
6
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.
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
KEYWORD
nonn,tabf
AUTHOR
Antti Karttunen, Aug 03 2010
STATUS
approved