OFFSET
1,2
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10700
PROG
(Haskell)
import Data.List (elemIndices)
a188650 n = a188650_list !! (n-1)
a188650_list =
map succ $ elemIndices 0 $ zipWith (-) [1..] $ map a188649 [1..]
(PARI) rev(n:int, B=10)=my(m=n%B); n\=B; while(n>0, m=m*B+n%B; n\=B); m
is(n)=fordiv(n, d, if(n%rev(d), return(0))); 1 \\ Charles R Greathouse IV, Jul 14 2011
(Python)
from math import lcm
from sympy import divisors
def ok(n): return n == lcm(*(int(str(d)[::-1]) for d in divisors(n)))
print([k for k in range(1, 10000) if ok(k)]) # Michael S. Branicky, Sep 30 2022
CROSSREFS
KEYWORD
nonn,base
AUTHOR
Reinhard Zumkeller, Apr 11 2011
STATUS
approved