The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A249067 Smallest k such that {first digit of j*n, 0<=j<=k} = {0,1,...,9}. 1
 9, 45, 27, 23, 18, 15, 13, 12, 9, 9, 9, 42, 62, 43, 54, 44, 53, 45, 43, 45, 43, 41, 35, 34, 36, 35, 34, 33, 32, 27, 26, 25, 25, 27, 26, 25, 25, 24, 24, 23, 22, 22, 21, 21, 18, 18, 18, 17, 17, 18, 18, 18, 17, 17, 17, 17, 16, 16, 16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS In other words: a(n) = how long until you have seen every first-digit that you can in the n times table. Conjecture: a(n) <= N for all n. Perhaps N can be taken as 81. - Charles R Greathouse IV, Oct 20 2014 The conjecture above is true. In fact, a(n) takes on precisely 37 values: 9, 11, 12, 13, 14, 15, 16, 17, 18, 21, 22, 23, 24, 25, 26, 27, 31, 32, 33, 34, 35, 36, 41, 42, 43, 44, 45, 51, 52, 53, 54, 61, 62, 63, 71, 72, and 81. The last of these to occur is a(291) = 31. - Charles R Greathouse IV, Mar 17 2018 LINKS Alois P. Heinz, Table of n, a(n) for n = 1..10000 EXAMPLE a(2) = 45, because the first time a multiple of 2 starts with a 9 is 45*2 = 90, and all other first-digits occur earlier than that. MAPLE a:= proc(n) local j, s; s:={}; for j while s<>{\$1..9} do s:= s union {(p-> iquo(p, 10^(length(p)-1)))(j*n)} od; j-1 end: seq(a(n), n=1..100); # Alois P. Heinz, Oct 20 2014 PROG (Python) def a(n): ...got = [0]*10 ...i = 1 ...while sum(got)<9: ......d=int(str(n*i)[0]) ......got[d] = 1 ......i += 1 ...return i-1 (PARI) a(n)=my(v=vector(9), s, k, t); while(s<9, t=digits(k++*n)[1]; if(v[t]==0, v[t]=1; s++)); k \\ Charles R Greathouse IV, Oct 20 2014 CROSSREFS Sequence in context: A225488 A096688 A181431 * A124983 A087969 A044111 Adjacent sequences: A249064 A249065 A249066 * A249068 A249069 A249070 KEYWORD nonn,base,look,easy AUTHOR Christian Perfect, Oct 20 2014 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified January 29 08:01 EST 2023. Contains 359915 sequences. (Running on oeis4.)
{"found_math": false, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}