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

A113557 Least multiple of n in which the n-th digit from left is 2.

Original entry on oeis.org

2, 12, 102, 1012, 100020, 100002, 1000062, 10000032, 100000062, 10000000020, 10000000032, 100000000032, 1000000000012, 10000000000032, 1000000000000020, 1000000000000032, 10000000000000152, 100000000000000062, 1000000000000000132
Offset: 1

Views

Author

Amarnath Murthy, Nov 06 2005

Keywords

Examples

			a(4)= 1012, in which the fourth digit is 2.
		

Crossrefs

Cf. A113556.

Extensions

More terms from R. J. Mathar, Mar 13 2006
More terms from Joshua Zucker, May 03 2006

A113558 Least multiple of n in which the n-th digit from left is 3.

Original entry on oeis.org

3, 130, 123, 10032, 100030, 1000032, 1000013, 100000032, 100000053, 10000000030, 10000000043, 1000000000032, 1000000000103, 100000000000138, 1000000000000035, 10000000000000032, 10000000000000033, 1000000000000000134
Offset: 1

Views

Author

Amarnath Murthy, Nov 06 2005

Keywords

Examples

			a(4)= 10032, in which the fourth digit is 3.
		

Crossrefs

Programs

  • PARI
    dig(n,digno,base) = { local(nshif) ; nshif=n ; for(shifr=0,digno-1, nshif = floor(nshif/base) ; ) ; nshif % base ; } ndig(n,base) = { local(nshif,resul) ; nshif=n ; resul=1 ; while(nshif>0, nshif = floor(nshif/base) ; if( nshif>0, resul++, break) ; ) ; return(resul) ; } { for (n = 1, 23, anmin=10^(n-1) ; if ( ( n % 2 == 0 ) || (n %5 == 0), anmin *= 10) ; if ( ( n % 20 == 0 ) || (n %50 == 0), anmin *= 10) ; for( nex = anmin,anmin+10000000000000000000000, if ( ( nex % n) != 0, next ; ) ; nexd=ndig(nex,10) ; if( dig(nex,nexd-n,10)==3, print(nex,",") ; break ; ) ; ); ) } \\ R. J. Mathar, Mar 15 2006

Extensions

More terms from R. J. Mathar, Mar 15 2006

A113560 Least multiple of n in which the n-th digit from left is 5.

Original entry on oeis.org

5, 150, 105, 10052, 10005, 1000050, 1000055, 100000056, 100000035, 10000000050, 10000000065, 1000000000056, 1000000000025, 100000000000054, 100000000000005, 10000000000000256, 10000000000000135, 1000000000000000152, 1000000000000000075, 1000000000000000000500
Offset: 1

Views

Author

Amarnath Murthy, Nov 06 2005

Keywords

Examples

			a(4) = 4 * 2513 = 10052, in which the fourth digit is 5.
		

Crossrefs

Programs

  • Maple
    f:= proc(n) local d,m,R,v;
        for d from n do
          R:= {};
          for m from ceil(10^(d-1)/n) do
            v:= m*n;
            if v > 10^d then break fi;
            v:= v mod 10^(d-n+1);
            if member(v,R) then break fi;
            if floor(v/10^(d-n)) = 5 then return m*n fi;
            R:= R union {v};
          od
        od;
    end proc:
    map(f, [$1..30]); # Robert Israel, Mar 15 2024

Extensions

More terms from Joshua Zucker, May 03 2006

A113559 Least multiple of n in which the n-th digit from left is 4.

Original entry on oeis.org

4, 14, 114, 1004, 100040, 100014, 1000034, 10000024, 100000044, 10000000040, 10000000054, 100000000044, 1000000000064, 10000000000004, 1000000000000140, 1000000000000064, 10000000000000084, 100000000000000044, 1000000000000000094
Offset: 1

Views

Author

Amarnath Murthy, Nov 06 2005

Keywords

Examples

			a(4)= 1004, in which the fourth digit is 4.
		

Crossrefs

Extensions

More terms from Joshua Zucker and Carolyn Debelak (cdebelak(AT)ashland.edu), May 03 2006

A113561 Least multiple of n in which the n-th digit from left is 6.

Original entry on oeis.org

6, 16, 126, 1016, 100060, 100026, 1000006, 10000016, 100000026, 10000000060, 10000000076, 100000000056, 1000000000116, 10000000000046, 1000000000000065, 1000000000000016, 10000000000000016, 100000000000000026, 1000000000000000056
Offset: 1

Views

Author

Amarnath Murthy, Nov 06 2005

Keywords

Examples

			a(4)= 10060, in which the fourth digit is 6.
		

Crossrefs

Extensions

Corrected and extended by Joshua Zucker, May 03 2006

A113562 Least multiple of n in which the n-th digit from left is 7.

Original entry on oeis.org

7, 170, 117, 10072, 100070, 1000074, 1000027, 100000072, 100000017, 10000000070, 10000000087, 1000000000176, 1000000000077, 100000000000278, 1000000000000170, 10000000000000176, 10000000000000067, 1000000000000000170
Offset: 1

Views

Author

Amarnath Murthy, Nov 06 2005

Keywords

Examples

			a(4)= 10072, in which the fourth digit is 7.
		

Crossrefs

Programs

  • Mathematica
    lmn7[n_]:=Module[{k=Ceiling[10^(n-1)/n]},While[NumberDigit[k n,IntegerLength[ k n]-n]!=7,k++];k n]; Array[lmn7,10] (* The program generates the first 10 terms of the sequence. *)  (* Harvey P. Dale, Nov 02 2022 *)

Extensions

More terms from Joshua Zucker, May 03 2006

A113563 Least multiple of n in which the n-th digit from left is 8.

Original entry on oeis.org

8, 18, 108, 1008, 100080, 100008, 1000048, 10000008, 100000008, 10000000080, 10000000098, 100000000008, 1000000000038, 10000000000018, 1000000000000080, 1000000000000048, 10000000000000118, 100000000000000008, 1000000000000000018
Offset: 1

Views

Author

Amarnath Murthy, Nov 06 2005

Keywords

Examples

			a(4)= 1008, in which the fourth digit is 8.
		

Crossrefs

Extensions

More terms from Joshua Zucker, May 03 2006

A113564 Least multiple of n in which the n-th digit from left is 9.

Original entry on oeis.org

9, 190, 129, 10092, 100090, 1000092, 1000069, 100000096, 100000089, 10000000090, 10000000109, 1000000000092, 1000000000129, 100000000000096, 1000000000000095, 10000000000000096, 10000000000000169
Offset: 1

Views

Author

Amarnath Murthy, Nov 06 2005

Keywords

Examples

			a(4)= 10092, in which the fourth digit is 9.
		

Crossrefs

Extensions

More terms from Peter Soung (soung3(AT)hotmail.com), Jan 23 2006
Showing 1-8 of 8 results.