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 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).
%I #11 Sep 05 2020 17:47:07
%S 2,1,0,0,12,4,24,5,4,7,13,9,3,41,34,4,2,37,46,59,74,83,11,32,167,58,
%T 59,65,43,27,24,192,208,157,88,64,49,11,5,35,49,78,61,145,155,217,86,
%U 208,217,81,78,148,112,14,101,59,14,294,16,22,379,55,42,402,245,409,411,44
%N a(1) = 2; a(n) = smallest number such that the n-th partial concatenation is a multiple of prime(n).
%H Harvey P. Dale, <a href="/A088632/b088632.txt">Table of n, a(n) for n = 1..200</a>
%t Module[{p=Prime[n],k=0},While[!Divisible[FromDigits[Flatten[ Join[ {conc},IntegerDigits[ k]]]],Prime[n]],k++];{FromDigits[Flatten[ Join[ {conc},IntegerDigits[k]]]],n+1,k}]; NestList[nxt,{2,2,2},70][[All,3]] (* _Harvey P. Dale_, Sep 05 2020 *)
%K base,nonn
%O 1,1
%A _Amarnath Murthy_, Oct 23 2003
%E Corrected and extended by _David Wasserman_, Aug 16 2005