login
A253050
A252867 read mod 2.
5
0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 0, 1, 0, 0, 1, 0
OFFSET
0
COMMENTS
if a(n) = 1, then a(n+1) = 0 as two consecutive odd numbers would share a bit. - Chai Wah Wu, Jan 01 2015
PROG
(Python)
A253050_list, l1, l2, s, b = [0, 1, 0], 2, 1, 3, set()
for _ in range(10**4):
....i = s
....while True:
........if not (i in b or i & l1) and i & l2:
............A253050_list.append(i & 1)
............l2, l1 = l1, i
............b.add(i)
............while s in b:
................b.remove(s)
................s += 1
............break
........i += 1 # Chai Wah Wu, Jan 01 2015
CROSSREFS
Sequence in context: A303591 A159684 A244221 * A241575 A285684 A163538
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, Jan 01 2015
STATUS
approved