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.

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

This page as a plain text file.
%I A113562 #6 Nov 02 2022 17:44:50
%S A113562 7,170,117,10072,100070,1000074,1000027,100000072,100000017,
%T A113562 10000000070,10000000087,1000000000176,1000000000077,100000000000278,
%U A113562 1000000000000170,10000000000000176,10000000000000067,1000000000000000170
%N A113562 Least multiple of n in which the n-th digit from left is 7.
%e A113562 a(4)= 10072, in which the fourth digit is 7.
%t A113562 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 *)
%Y A113562 Cf. A113556, A113557, A113558, A113559, A113560, A113561.
%K A113562 base,easy,nonn
%O A113562 1,1
%A A113562 _Amarnath Murthy_, Nov 06 2005
%E A113562 More terms from _Joshua Zucker_, May 03 2006