A367625 (A036991(n)-1)/2.
0, 1, 2, 3, 5, 6, 7, 9, 10, 11, 13, 14, 15, 19, 21, 22, 23, 25, 26, 27, 29, 30, 31, 35, 37, 38, 39, 41, 42, 43, 45, 46, 47, 51, 53, 54, 55, 57, 58, 59, 61, 62, 63, 71, 75, 77, 78, 79, 83, 85, 86, 87, 89, 90, 91, 93, 94, 95, 99, 101, 102, 103, 105, 106, 107, 109, 110, 111, 115, 117, 118, 119, 121, 122, 123, 125, 126, 127
Offset: 2
Keywords
Links
- N. J. A. Sloane, Table of n, a(n) for n = 2..13496
Programs
-
Python
from itertools import count, islice def A367625_gen(startvalue=0): # generator of terms >= startvalue if startvalue <= 0: yield 0 for n in count(max(startvalue,1)): s = bin(n)[2:] c, l = 2, len(s) for i in range(1,l+1): c += int(s[l-i])<<1 if c <= i: break else: yield n A367625_list = list(islice(A367625_gen(),30)) # Chai Wah Wu, Nov 28 2023