A306874 Lexicographically earliest sequence of distinct positive terms such that the binary representation of the bitwise-OR of two consecutive terms has exactly one run of consecutive zeros.
1, 4, 2, 6, 8, 3, 9, 5, 12, 10, 11, 16, 7, 17, 13, 20, 14, 18, 19, 21, 22, 23, 32, 15, 33, 24, 25, 26, 27, 34, 28, 29, 36, 30, 38, 35, 37, 39, 40, 47, 41, 46, 43, 44, 48, 45, 42, 49, 50, 51, 52, 55, 53, 54, 56, 57, 58, 59, 64, 31, 65, 60, 61, 68, 62, 66, 67
Offset: 1
Examples
The first terms, alongside the binary representation of a(n) OR a(n+1), are: n a(n) bin(a(n) OR a(n+1)) -- ---- ------------------- 1 1 101 2 4 110 3 2 110 4 6 1110 5 8 1011 6 3 1011 7 9 1101 8 5 1101 9 12 1110 10 10 1011 11 11 11011 12 16 10111 13 7 10111 14 17 11101 15 13 11101
Links
- Rémy Sigrist, Table of n, a(n) for n = 1..16384
- Rémy Sigrist, PARI program for A306874
Programs
-
PARI
See Links section.
Formula
A087116(a(n) OR a(n+1)) = 1.
Comments