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

 Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 60th year, we have over 367,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”). Other ways to Give
 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A077310 Smallest multiple of n that is a concatenation of (increasing) natural numbers starting with(n+1). 3

%I #15 Aug 02 2020 13:05:23

%S 2,34,45,56,678910,78,8910111213141516,9101112,1011121314151617,

%T 11121314151617181920,12131415161718192021,1314151617181920,

%U 14151617181920212223242526272829303132333435,15161718192021222324252627282930,1617181920,17181920,1819,1920212223242526

%N Smallest multiple of n that is a concatenation of (increasing) natural numbers starting with(n+1).

%C a(37) has 2968 digits. - _Harvey P. Dale_, Aug 02 2020

%H Harvey P. Dale, <a href="/A077310/b077310.txt">Table of n, a(n) for n = 1..36</a>

%t smn[n_]:=Module[{k=n+1,q=0},While[Mod[FromDigits[Flatten[ IntegerDigits/@ Range[ k,k+q]]],n]!=0,q++];FromDigits[ Flatten[IntegerDigits/@ Range[ k,q+k]]]]; Array[smn,20] (* _Harvey P. Dale_, Aug 02 2020 *)

%Y Cf. A077311, A077312.

%K base,nonn

%O 1,1

%A _Amarnath Murthy_, Nov 03 2002

%E More terms from Mark Hudson (mrmarkhudson(AT)hotmail.com), Aug 25 2004

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 December 7 18:28 EST 2023. Contains 367660 sequences. (Running on oeis4.)