The OEIS is supported by the many generous donors to the OEIS Foundation.
%I #10 Apr 19 2015 22:35:13
%S 2,3,5,7,209,247,476,874,1679,4988,8959,37999,177899,99889,686999,
%T 2989889,8888999,9998998,58999999,289999997,499988899,999899998,
%U 5989989899,9989999999,99999999898,2918999999999,699999899899,1999989999989,4889999999989,8899999999898
%N Smallest multiple of prime(n) whose digits sum is divisible by prime(n).
%C Subsequence of A002998.
%F a(n) = A002998(A000040(n)).
%e a(5)=209 is in the sequence because prime(5)=11 divides 2+0+9 and 209.
%t Flatten[Table[Select[Prime[n] Range[10^8],Total[IntegerDigits[#]]==Prime[n]&,1],{n,1,21}]]
%o (PARI) lista(nn) = {forprime(p=2, nn, k = 1; while(((q = k*p) && (sumdigits(q) % p)), k++); print1(q, ", "););} \\ _Michel Marcus_, Apr 14 2015
%Y Cf. A000040, A002998.
%K nonn,base
%O 1,1
%A _Michel Lagneau_, Apr 12 2015