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.

A181929 Numbers n such that n is the substring identical to the most significant bits of its base 2 representation.

Original entry on oeis.org

0, 1, 10, 110, 10011, 110101, 10011000, 110100011, 10010101001, 101111000101, 110011001110, 10010001101010, 101101111110011, 110010000001101, 1111110010100011, 10001110000111111, 101100111001011100, 110000110110011001, 1111011010110001101
Offset: 1

Views

Author

Douglas Latimer, Apr 02 2012

Keywords

Comments

The main idea behind my program is that if we say start searching from 10000, which is 10011... binary, then as the binary string for the first 5 places is larger than our decimal value, then the decimal value can be immediately jumped to 10011 for the next search number. Repeating this process (while also doing slight jumps if the decimal value is larger than the binary), allows ones to do very large jumps in the checked decimal values, sometimes eliminating an entire string of length n in just a few checks. I got the idea from similar people were using when searching for the next term in A258107. - Scott R. Shannon, Feb 25 2021

Examples

			The number 110 is represented in the binary system by the string "1101110". 110 is a three-digit number, so we consider the 3 most significant bits, which are "110", identical to the string of digits used to represent the number 110. Thus 110 is in the sequence.
		

Crossrefs

This is a subsequence of A038102. Sequence A181891 has a similar definition.
Subsequence of A007088.

Programs

  • Mathematica
    fQ[n_] := Module[{d = IntegerDigits[n], len}, len = Length[d]; d == Take[IntegerDigits[n, 2], len]]; Select[Range[0, 1000000], fQ] (* T. D. Noe, Apr 03 2012 *)
  • PARI
    {for(vv=0,2000000,bvv=binary(vv);
    ll=length(bvv);texp=0;btod=0;
    forstep(i=ll,1,-1,btod=btod+bvv[i]*10^texp;texp++);
    bigb=binary(btod);swsq=1;
    for(j=1,ll,if(bvv[j]!=bigb[j],swsq=0));
    if(swsq==1,print(btod)))}
    
  • PARI
    lista(nn) = {for (n=0, nn, if (n==0, print1(n, ", "), my(b = binary(n), db = fromdigits(b), bb = binary(db)); if (vector(#b, k, bb[k]) == b, print1(db, ", "));););} \\ Michel Marcus, Feb 10 2021