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!)
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,1 COMMENTS Subsequence of A002998. LINKS 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 Cf. A000040, A002998. Sequence in context: A046475 A029978 A122764 * A195302 A064157 A257483 Adjacent sequences:  A256883 A256884 A256885 * A256887 A256888 A256889 KEYWORD nonn,base AUTHOR Michel Lagneau, Apr 12 2015 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 May 25 23:50 EDT 2020. Contains 334612 sequences. (Running on oeis4.)