OFFSET
1,2
MATHEMATICA
smn[n_]:=Module[{k=1, id=IntegerDigits[n], c}, c=k*n; While[Take[ IntegerDigits[ c], IntegerLength[n]]!=id||Take[IntegerDigits[c], -IntegerLength[ n]]!=id||!Divisible[Total[IntegerDigits[k*n]], n], k++; c=k*n]; k*n]; Array[smn, 35] (* Harvey P. Dale, Sep 04 2020 *)
PROG
(PARI) {for(n=1, 34, k=length(Str(n)); s=n; t=s+1; d=k-length(Str(m)); s=s*10^d; t=t*10^d; b=1; while(b>0, q=floor(s/n); while(b>0&&(p=q*n)<t, m=0; z=p; while(z>0, y=divrem(z, 10); z=y[1]; m=m+y[2]); if(p>=s&&(p%10^k) == n&&(m%n) == 0, print1(p, ", "); b=0, q++)); s=10*s; t=10*t))}
CROSSREFS
KEYWORD
base,nonn
AUTHOR
Amarnath Murthy, Nov 22 2002
EXTENSIONS
Edited and extended by Klaus Brockhaus, Dec 09 2002
STATUS
approved