A277008 Numbers k such that in the binary expansion of k no run of 1-bits is longer than 1 + the total number of 0-bits anywhere to the right of that run.

0, 1, 2, 4, 5, 6, 8, 9, 10, 12, 13, 16, 17, 18, 20, 21, 22, 24, 25, 26, 28, 32, 33, 34, 36, 37, 38, 40, 41, 42, 44, 45, 48, 49, 50, 52, 53, 54, 56, 57, 58, 64, 65, 66, 68, 69, 70, 72, 73, 74, 76, 77, 80, 81, 82, 84, 85, 86, 88, 89, 90, 92, 96, 97, 98, 100, 101, 102, 104, 105, 106, 108, 109, 112, 113, 114, 116, 117, 118, 120, 128

Offset: 0

Author

Antti Karttunen, Sep 25 2016

Keywords

• nonn
• base
• changed

Comments

Numbers k for which A277007(k) = 0.

Indexing starts from zero as a(0) = 0 is a special case in this sequence.

Links

• Antti Karttunen, Table of n, a(n) for n = 0..10000
• Index entries for sequences related to binary expansion of n
• Index entries for sequences related to factorial base representation

Crossrefs

Complement: A277009.

Positions of zeros in A277007.

Sequence A277012 sorted into ascending order.

Cf. A005940, A276077, A276078.

Subsequence of A277018 from which this differs for the first time at n=41, where a(41)=64, skipping the value 60 present in A277018.

Programs

Scheme

;; With Antti Karttunen's IntSeq-library.
(define A277008 (ZERO-POS 0 0 A277007))

Formula

Other identitities:

A276077(A005940(1+a(n))) = 0 for all n.