proposed
approved
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”).
proposed
approved
editing
proposed
a = [0] + flatten([n.digits(base=2)[::-1] for n in IntegerRange(1, N)])
approved
editing
proposed
approved
editing
proposed
def A174205(N=100):
.... a = [0] + flatten([n.digits(base=2)[::-1] for n in IntegerRange(1, 100N)]
.... for bit in 0, 1:
........ a = [d for i, d in enumerate(a) if not (d == bit and a[:i+1].count(bit) % 2 == 1)]
.... return a # D. S. McNeil, Dec 08 2010
approved
editing
proposed
approved
editing
proposed
_Paolo P. Lava & _ and _Giorgio Balzarotti (paoloplava(AT)gmail.com), _, Mar 15 2010