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!)
 A211403 The smallest n-digit number where last k digits are divisible by k-th prime for k = 1..n. 0
 0, 12, 100, 1190, 10560, 217490, 1377000, 18319800, 224246090 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS There are 9 terms in the sequence and 9-digit number 224246090 is the last number to satisfy the requirements. LINKS EXAMPLE There are five one-digit numbers divisible by first prime and smallest is 0 so a(1)=0. For 2-digit numbers, the tens digit must make it divisible by 3 which gives 12 as smallest to satisfy the requirement so a(2)=12. CROSSREFS Cf. A079212. Sequence in context: A243880 A338811 A199681 * A008547 A109020 A099299 Adjacent sequences:  A211400 A211401 A211402 * A211404 A211405 A211406 KEYWORD nonn,base,fini,full AUTHOR Shyam Sunder Gupta, Aug 07 2013 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 July 25 10:49 EDT 2021. Contains 346289 sequences. (Running on oeis4.)