login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A167501
Sequence of bits in A167500 (= list of nonzero bits in this sequence, when written in binary).
2
1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0
OFFSET
1,1
COMMENTS
Sequence A167500 starts 1,2,4,7,... = 1,10,100,111,.... when written in binary (A167502). This sequence lists the bits one by one, MSB first: 1,1,0,1,0,0,1,1,1,...; by definition A167500 lists the nonzero terms of this function, and reciprocally this sequence is the characteristic function of A167500.
PROG
(PARI) a=b=[]; for(n=1, 30, #b >= n & for( i=a[n-1]+1, #b, b[i] & (a=concat(a, i)) & break); #a<n & a=concat(a, #b+1); b=concat(b, binary( a[n] ))); b
CROSSREFS
Cf. A167500 (lists nonzero terms in this sequence), A167502.
Sequence in context: A275661 A266716 A190242 * A285533 A185175 A379485
KEYWORD
base,nonn
AUTHOR
M. F. Hasler, Nov 05 2009
STATUS
approved