login
A179763
Binary expansions of A179757 concatenated together to a single binary sequence, so that from each term of A179757, the most significant bits come before the least significant bits.
9
1, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0
OFFSET
1,1
COMMENTS
When viewed as a table, the first row contains six terms, the second eight, the third ten, and so on, i.e. row n contains 2(n+2) terms.
PROG
(MIT Scheme:) (define (A179763 n) (modulo (floor->exact (/ (A179757 (- (A000194 (+ n 6)) 2)) (expt 2 (A179753 (+ n 6))))) 2))
CROSSREFS
KEYWORD
nonn,tabf
AUTHOR
Antti Karttunen, Aug 03 2010
STATUS
approved