OFFSET
1,1
COMMENTS
First differs from A161602 in lacking 70, with binary expansion (1,0,0,0,1,1,0), positions of 1's 1 + 5 + 6 = 12, reversed 2 + 3 + 7 = 12.
EXAMPLE
The initial terms, binary expansions, and positions of 1's are:
2: 10 ~ {2}
4: 100 ~ {3}
6: 110 ~ {2,3}
8: 1000 ~ {4}
10: 1010 ~ {2,4}
12: 1100 ~ {3,4}
13: 1101 ~ {1,3,4}
14: 1110 ~ {2,3,4}
16: 10000 ~ {5}
18: 10010 ~ {2,5}
20: 10100 ~ {3,5}
22: 10110 ~ {2,3,5}
24: 11000 ~ {4,5}
25: 11001 ~ {1,4,5}
26: 11010 ~ {2,4,5}
28: 11100 ~ {3,4,5}
29: 11101 ~ {1,3,4,5}
30: 11110 ~ {2,3,4,5}
MATHEMATICA
Select[Range[100], Total[Accumulate[IntegerDigits[#, 2]]]>Total[Accumulate[Reverse[IntegerDigits[#, 2]]]]&]
PROG
(Python 3.10+)
from itertools import count, islice
def A359496_gen(startvalue=0): # generator of terms >= startvalue
return filter(lambda n:sum(i for i, j in enumerate(bin(n)[2:]) if j=='1')<<1 < n.bit_count()*(n.bit_length()-1), count(max(startvalue, 0)))
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Gus Wiseman, Jan 18 2023
STATUS
approved