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.
%I A190302 #14 Jul 28 2018 10:40:15 %S A190302 1,5,4,3,2,2,2,2,2,1,1,1,1,1,1,1,1,1,1,5,5,5,5,5,4,4,4,4,4,4,4,4,4,3, %T A190302 3,3,3,3,3,3,3,3,3,3,3,3,3,3,3,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2, %U A190302 2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,2,1,1,1,1,1,1 %N A190302 Smallest number h such that the decimal expansion of n*h starts with 1. %C A190302 Quotient of the smallest multiple of n beginning with 1 (A187285(n)) and n. %C A190302 Conjecture: a(n) < 6 for all n (verified to n = 10022141). - _Felix Fröhlich_, Jul 28 2018 %H A190302 Nathaniel Johnston, <a href="/A190302/b190302.txt">Table of n, a(n) for n = 1..10000</a> %F A190302 a(n) = A187285(n) / n. %e A190302 For n = 7: a(7) = 2 because 2 * 7 = 14. Number 14 is the smallest number beginning with 1 divisible by 7. %p A190302 A190302 := proc(n) local d,h: for h from 1 do d:=convert(n*h,base,10): if(d[nops(d)]=1)then return h: fi: od: end: seq(A190302(n), n=1..105); # _Nathaniel Johnston_, Jun 15 2011 %o A190302 (PARI) a(n) = my(h=1, inid=0); while(1, my(inid=digits(n*h)[1]); if(inid==1, return(h)); h++) \\ _Felix Fröhlich_, Jul 28 2018 %Y A190302 Cf. A187285. %K A190302 nonn,easy,base %O A190302 1,2 %A A190302 _Jaroslav Krizek_, May 07 2011