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.

Previous Showing 31-33 of 33 results.

A166111 A positive integer n is included if the longest contiguous run of similar digits in binary n is of 1's.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 10, 11, 12, 13, 14, 15, 19, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 38, 39, 42, 43, 44, 45, 46, 47, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 71, 75, 76, 77, 78, 79, 83, 85, 86, 87, 89, 90, 91, 92, 93, 94, 95, 100, 101, 102, 103, 105, 106, 107
Offset: 1

Views

Author

Leroy Quet, Oct 06 2009

Keywords

Comments

For some n included in this sequence, it is possible that the longest run of 0's in binary n is of the same length as the longest run of 1's in binary n. (See sequence A090050.)

Crossrefs

Cf. A043276, A090050, A166110.

Programs

  • Mathematica
    lcr1Q[n_]:=Module[{s=Split[IntegerDigits[n,2]]},Max[Length/@Select[s, MemberQ[ #,1]&]] >= Max[Length/@Select[s,MemberQ[#,0]&]]]; Select[ Range[ 120],lcr1Q] (* Harvey P. Dale, Feb 01 2019 *)

Extensions

Extended by Ray Chandler, Mar 12 2010

A175665 The product of maximal run and minimal run lengths in the binary representation of n.

Original entry on oeis.org

1, 1, 4, 2, 1, 2, 9, 3, 2, 1, 2, 4, 2, 3, 16, 4, 3, 2, 2, 2, 1, 2, 3, 6, 2, 2, 2, 6, 3, 4, 25, 5, 4, 3, 3, 2, 2, 2, 3, 3, 2, 1, 2, 2, 2, 3, 4, 8, 3, 2, 4, 2, 2, 2, 3, 9, 3, 3, 3, 8, 4, 5, 36, 6, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 3, 4, 4, 3, 2, 2, 2, 1, 2, 3, 3, 2, 2, 2, 3, 3, 4, 5, 10, 4, 3, 6, 2, 2, 2, 6, 3
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Aug 04 2010

Keywords

Crossrefs

Cf. A175599.

Formula

a(n)=A043276(n)*A175597(n).

Extensions

Corrected by D. S. McNeil, Nov 26 2010

A175681 The sum of maximal run and minimal run lengths in binary representation of n.

Original entry on oeis.org

2, 2, 4, 3, 2, 3, 6, 4, 3, 2, 3, 4, 3, 4, 8, 5, 4, 3, 3, 3, 2, 3, 4, 5, 3, 3, 3, 5, 4, 5, 10, 6, 5, 4, 4, 3, 3, 3, 4, 4, 3, 2, 3, 3, 3, 4, 5, 6, 4, 3, 4, 3, 3, 3, 4, 6, 4, 4, 4, 6, 5, 6, 12, 7, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 4, 5, 5, 4, 3, 3, 3, 2, 3, 4, 4, 3, 3, 3, 4, 4, 5, 6, 7, 5, 4, 5, 3, 3, 3, 5, 3, 3
Offset: 1

Views

Author

Juri-Stepan Gerasimov, Aug 08 2010

Keywords

Crossrefs

Cf. A175599, A175665.

Formula

a(n)=A043276(n)+A175597(n).
Previous Showing 31-33 of 33 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.