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-3 of 3 results.

A144795 A positive integer n is included if every 1 in binary n is next to at least one other 1.

Original entry on oeis.org

3, 6, 7, 12, 14, 15, 24, 27, 28, 30, 31, 48, 51, 54, 55, 56, 59, 60, 62, 63, 96, 99, 102, 103, 108, 110, 111, 112, 115, 118, 119, 120, 123, 124, 126, 127, 192, 195, 198, 199, 204, 206, 207, 216, 219, 220, 222, 223, 224, 227, 230, 231, 236, 238, 239, 240, 243, 246
Offset: 1

Views

Author

Leroy Quet, Sep 21 2008

Keywords

Comments

n is included if A144790(n) >= 2.
A173024 is a subsequence. - Reinhard Zumkeller, Feb 07 2010

Crossrefs

Complement of A377169.

Programs

  • Maple
    isA144795 := proc(n) local bind,i ; bind := convert(n,base,2) ; for i from 1 to nops(bind) do if i = 1 then if op(i,bind) = 1 and op(i+1,bind) = 0 then RETURN(false) : fi; elif i = nops(bind) then if op(i,bind) = 1 and op(i-1,bind) = 0 then RETURN(false) : fi; else if op(i,bind) = 1 and op(i-1,bind) = 0 and op(i+1,bind) = 0 then RETURN(false) : fi; fi; od: RETURN(true) ; end: for n from 3 to 400 do if isA144795(n) then printf("%d,",n) ; fi; od: # R. J. Mathar, Sep 29 2008
  • Mathematica
    Select[Range@ 250, AllTrue[Map[Length, Select[Split@ IntegerDigits[#, 2], First@ # == 1 &]], # > 1 &] &] (* Michael De Vlieger, Aug 20 2017 *)

Extensions

Extended by R. J. Mathar, Sep 29 2008

A173021 Number of numbers <= n whose binary representation is without isolated ones or isolated double ones.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 9, 9, 10, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11
Offset: 0

Views

Author

Reinhard Zumkeller, Feb 07 2010

Keywords

Examples

			a(30) = #{0, 7, 14, 15, 28, 30} = #{0, 111, 1110, 1111, 11100, 11110} = 6.
		

Crossrefs

Programs

  • Mathematica
    ioQ[n_]:=Module[{idn2=Split[IntegerDigits[n,2]]},FreeQ[idn2,{1}]&&FreeQ[ idn2,{1,1}]]; Accumulate[Table[If[ioQ[n],1,0],{n,0,90}]] (* Harvey P. Dale, May 15 2016 *)

Formula

a(A173024(n+1)) = a(A173024(n)) + 1.
a(2^n - 1) = A005252(n+1).
a(n) <= A173022(n) <= A173023(n).

A173025 Numbers whose binary representation contains no isolated digits "11".

Original entry on oeis.org

0, 1, 2, 4, 5, 7, 8, 9, 10, 14, 15, 16, 17, 18, 20, 21, 23, 28, 29, 30, 31, 32, 33, 34, 36, 37, 39, 40, 41, 42, 46, 47, 56, 57, 58, 60, 61, 62, 63, 64, 65, 66, 68, 69, 71, 72, 73, 74, 78, 79, 80, 81, 82, 84, 85, 87, 92, 93, 94, 95, 112, 113, 114, 116, 117, 119, 120, 121, 122
Offset: 1

Views

Author

Reinhard Zumkeller, Feb 07 2010

Keywords

Crossrefs

A173024 is a subsequence.

Programs

  • Mathematica
    Select[Range[0, 150], FreeQ[Split[IntegerDigits[#, 2]], {1, 1}] &] (* Paolo Xausa, Oct 15 2024 *)

Formula

A173021(a(n+1)) = A173021(a(n)) + 1.
Showing 1-3 of 3 results.