This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A256886 #10 Apr 19 2015 22:35:13
%S A256886 2,3,5,7,209,247,476,874,1679,4988,8959,37999,177899,99889,686999,
%T A256886 2989889,8888999,9998998,58999999,289999997,499988899,999899998,
%U A256886 5989989899,9989999999,99999999898,2918999999999,699999899899,1999989999989,4889999999989,8899999999898
%N A256886 Smallest multiple of prime(n) whose digits sum is divisible by prime(n).
%C A256886 Subsequence of A002998.
%F A256886 a(n) = A002998(A000040(n)).
%e A256886 a(5)=209 is in the sequence because prime(5)=11 divides 2+0+9 and 209.
%t A256886 Flatten[Table[Select[Prime[n] Range[10^8],Total[IntegerDigits[#]]==Prime[n]&,1],{n,1,21}]]
%o A256886 (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 A256886 Cf. A000040, A002998.
%K A256886 nonn,base
%O A256886 1,1
%A A256886 _Michel Lagneau_, Apr 12 2015