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

 

Logo
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

%I #15 Aug 07 2013 18:22:10

%S 0,12,100,1190,10560,217490,1377000,18319800,224246090

%N The smallest n-digit number where last k digits are divisible by k-th prime for k = 1..n.

%C There are 9 terms in the sequence and 9-digit number 224246090 is the last number to satisfy the requirements.

%e 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.

%Y Cf. A079212.

%K nonn,base,fini,full

%O 1,2

%A _Shyam Sunder Gupta_, Aug 07 2013

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 7 13:22 EDT 2024. Contains 375730 sequences. (Running on oeis4.)