cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A277018 Numbers n for which A277017(n) = 0; range of A277022 sorted into ascending order.

Original entry on oeis.org

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, 60, 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
Offset: 0

Views

Author

Antti Karttunen, Sep 26 2016

Keywords

Comments

Numbers such that no run of 1-bits has length >= A000040(1 + the total number of 0-bits anywhere right of that run in the binary expansion of n).
Indexing starts from zero as a(0) = 0 is a special case in this sequence.

Examples

			60 ("111100" in binary, A007088) is present as 4 < prime(2+1) = 5.
		

Crossrefs

Complement: A277019.
Positions of zeros in A277017.
Sequence A277022 sorted into ascending order.
Differs from its subsequence of A277008 for the first time at n=41, where a(41)=60, a value which is missing from A277008.

Formula

Other identitities:
A129251(A005940(1+a(n))) = 0 for all n.