The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077306 Smallest multiple of n formed by the concatenation of n successive numbers, or 0 if no such number exists. 5
 1, 12, 123, 3456, 12345, 123456, 3456789, 56789101112, 123456789, 12345678910, 910111213141516171819, 123456789101112, 45678910111213141516, 7891011121314151617181920, 123456789101112131415, 567891011121314151617181920 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 LINKS Paul Tek, Table of n, a(n) for n = 1..333 MAPLE digs := proc(inp::integer) local resul, shiftinp : resul := 1 : shiftinp := iquo(inp, 10) : while shiftinp > 0 do resul := resul+1 : shiftinp := iquo(shiftinp, 10) : od : RETURN(resul) : end: # provide number of concatenation of frst up to lst newnum := proc(frst::integer, lst::integer) local resul, i : resul:= frst : for i from frst+1 to lst do resul := resul*10^digs(i)+i : od : RETURN(resul) ; end : n := 1 : while n < 20 do nold := n : newfeedstrt := 1 : newfeedend := newfeedstrt + n-1 : while nold = n do trythis := newnum(newfeedstrt, newfeedend) : if ( trythis mod n ) = 0 then printf("%a, ", trythis) ; n := n+ 1: break : fi : newfeedstrt := newfeedstrt + 1 : newfeedend := newfeedstrt + n-1 : od : od : # R. J. Mathar, Mar 13 2006 MATHEMATICA a[n_] := Block[{v, k = 1}, While[Mod[v = FromDigits@ Flatten@ IntegerDigits@ Range[k, k+n-1], n] > 0, k++]; v]; Array[a, 20] (* Giovanni Resta, May 12 2013 *) CROSSREFS Cf. A075000, A077308. Sequence in context: A141266 A083429 A226737 * A117640 A074158 A071269 Adjacent sequences:  A077303 A077304 A077305 * A077307 A077308 A077309 KEYWORD base,nonn AUTHOR Amarnath Murthy, Nov 03 2002 EXTENSIONS More terms from R. J. Mathar, Mar 13 2006 STATUS approved

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

Last modified May 31 13:01 EDT 2020. Contains 334748 sequences. (Running on oeis4.)