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.

Showing 1-1 of 1 results.

A223910 Numbers for which the maximal run of 1's in their binary representation contains even number of 1's.

Original entry on oeis.org

0, 3, 6, 11, 12, 13, 15, 19, 22, 24, 25, 26, 27, 30, 35, 38, 43, 44, 45, 47, 48, 49, 50, 51, 52, 53, 54, 60, 61, 63, 67, 70, 75, 76, 77, 79, 83, 86, 88, 89, 90, 91, 94, 96, 97, 98, 99, 100, 101, 102, 104, 105, 106, 107, 108, 109, 111, 120, 121, 122, 123, 126
Offset: 1

Views

Author

Vladimir Shevelev, Mar 29 2013

Keywords

Comments

We call these numbers "maxevil". The sequence is complement to A223909.
If a(n) is in the sequence, then 2^k*a(n) is in the sequence. If a(n)==0 (mod 4) is in the sequence, then a(n)+1 is in the sequence. If a(n)==0 (mod 8) is in the sequence, then a(n)+1, a(n)+2 are in the sequence. If a(n)==0 (mod 16) is in the sequence, then numbers a(n)+i, i<=6, are in the sequence.

Crossrefs

Programs

  • Mathematica
    Select[Range[0,200],EvenQ[Max[Map[Count[#,1]&,Split[IntegerDigits[#,2]]]]]&] (* Peter J. C. Moses, Mar 29 2013 *)
Showing 1-1 of 1 results.