OFFSET
1,2
COMMENTS
All positive repdigits (A010785) are terms.
There are infinitely many terms m for any of the 53 pairs (first digit, last digit) of m described below: when m begins with {1, 3, 7, 9} then m ends with any digit from 1 to 9; when m begins with {2, 4, 6, 8}, then m must also end with {2, 4, 6, 8}; to finish, when m begins with 5, m must only end with 5. - Metin Sariyar, Jan 29 2021
LINKS
David A. Corneth, Table of n, a(n) for n = 1..10000
MATHEMATICA
Select[Range[175], Mod[#, 10] > 0 && And @@ Divisible[#, IntegerDigits[#][[{1, -1}]]] &] (* Amiram Eldar, Jan 29 2021 *)
PROG
(Python)
def ok(n): s = str(n); return s[-1] != '0' and n%int(s[0])+n%int(s[-1]) == 0
print([m for m in range(180) if ok(m)]) # Michael S. Branicky, Jan 29 2021
(PARI) is(n) = n%10>0 && n%(n%10)==0 && n % (n\10^logint(n, 10)) == 0 \\ David A. Corneth, Jan 29 2021
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Bernard Schott, Jan 29 2021
STATUS
approved