The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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 LINKS Chai Wah Wu, Table of n, a(n) for n = 0..10000 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 Cf. A252867, A253051. Sequence in context: A303591 A159684 A244221 * A241575 A285684 A163538 Adjacent sequences:  A253047 A253048 A253049 * A253051 A253052 A253053 KEYWORD nonn AUTHOR N. J. A. Sloane, Jan 01 2015 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified November 28 05:30 EST 2021. Contains 349401 sequences. (Running on oeis4.)