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

 Please make a donation to keep the OEIS running. We are now in our 56th year. In the past year we added 10000 new sequences and reached almost 9000 citations (which often say "discovered thanks to the OEIS"). Other ways to donate

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A088632 a(1) = 2; a(n) = smallest number such that the n-th partial concatenation is a multiple of prime(n). 1
 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, 59, 65, 43, 27, 24, 192, 208, 157, 88, 64, 49, 11, 5, 35, 49, 78, 61, 145, 155, 217, 86, 208, 217, 81, 78, 148, 112, 14, 101, 59, 14, 294, 16, 22, 379, 55, 42, 402, 245, 409, 411, 44 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 LINKS Harvey P. Dale, Table of n, a(n) for n = 1..200 MATHEMATICA 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 *) CROSSREFS Sequence in context: A021480 A201299 A057274 * A057272 A062735 A054547 Adjacent sequences:  A088629 A088630 A088631 * A088633 A088634 A088635 KEYWORD base,nonn AUTHOR Amarnath Murthy, Oct 23 2003 EXTENSIONS Corrected and extended by David Wasserman, Aug 16 2005 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 November 27 22:11 EST 2020. Contains 338684 sequences. (Running on oeis4.)