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.

A189799 Least position k of n (n written in base 2) in the infinite string 101110111110111101100011001110111... (i.e., 23571113171923... in base 2).

Original entry on oeis.org

1, 1, 3, 19, 1, 4, 3, 19, 24, 50, 1, 18, 4, 3, 7, 86, 19, 44, 24, 50, 56, 16, 1, 18, 23, 49, 4, 42, 3, 8, 7, 177, 86, 185, 19, 100, 44, 52, 24, 225, 50, 478, 56, 16, 47, 1, 5, 85, 18, 43, 23, 49, 55, 15, 4
Offset: 1

Views

Author

Juri-Stepan Gerasimov, May 24 2011

Keywords

Examples

			1 appears as (1)0111..., 2 appears as (10)111011..., 3 as 10(11)10111..., 4 as 101110111110111101(100)0...
		

Crossrefs

Programs

  • Maple
    A189799 := proc(n)
            local abin ,nbin ,nlen;
            abin := ListTools[Reverse](convert(A154703(100),base,10)) ;
            nbin := ListTools[Reverse](convert(n,base,2)) ;
            nlen := nops(nbin) ;
            for i from 1 do
                    if verify(nbin,[op(i..i+nlen-1,abin)],'sublist') then
                            return i;
                    end if;
            end do:
            return 0 ;
    end proc:
    seq(A189799(n),n=1..55) ; # R. J. Mathar, Jun 07 2011

Extensions

Corrected by R. J. Mathar, Jun 07 2011