login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A256886
Smallest multiple of prime(n) whose digits sum is divisible by prime(n).
0
2, 3, 5, 7, 209, 247, 476, 874, 1679, 4988, 8959, 37999, 177899, 99889, 686999, 2989889, 8888999, 9998998, 58999999, 289999997, 499988899, 999899998, 5989989899, 9989999999, 99999999898, 2918999999999, 699999899899, 1999989999989, 4889999999989, 8899999999898
OFFSET
1,1
COMMENTS
Subsequence of A002998.
FORMULA
a(n) = A002998(A000040(n)).
EXAMPLE
a(5)=209 is in the sequence because prime(5)=11 divides 2+0+9 and 209.
MATHEMATICA
Flatten[Table[Select[Prime[n] Range[10^8], Total[IntegerDigits[#]]==Prime[n]&, 1], {n, 1, 21}]]
PROG
(PARI) lista(nn) = {forprime(p=2, nn, k = 1; while(((q = k*p) && (sumdigits(q) % p)), k++); print1(q, ", "); ); } \\ Michel Marcus, Apr 14 2015
CROSSREFS
Sequence in context: A029978 A360986 A122764 * A195302 A064157 A257483
KEYWORD
nonn,base
AUTHOR
Michel Lagneau, Apr 12 2015
STATUS
approved