OFFSET
1,2
COMMENTS
Union of A017281, A017293, A139222, A139245, A017329, A139249, A139264, A139279 and A139280. - Reinhard Zumkeller, Jun 22 2008
The differences between consecutive terms repeat with period 1177 and the corresponding terms differ by 2520 = LCM(1,2,...,9). In other words, a(k*1177+i) = 2520*k + a(i). - Giovanni Resta, Aug 20 2015
The asymptotic density of this sequence is 1177/2520 = 0.467063... (see A341431 and A341432 for the values in other base representations). - Amiram Eldar, Nov 24 2022
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
MAPLE
N:= 1000: # to get all terms <= N
sort([seq(seq(ilcm(10, d)*x+d, x=0..floor((N-d)/ilcm(10, d))), d=1..9)]); # Robert Israel, Aug 20 2015
MATHEMATICA
dldQ[n_]:=Module[{idn=IntegerDigits[n], last1}, last1=Last[idn]; last1!= 0&&Divisible[n, last1]]; Select[Range[150], dldQ] (* Harvey P. Dale, Apr 25 2011 *)
Select[Range[150], Mod[#, 10]!=0&&Divisible[#, Mod[#, 10]]&] (* Harvey P. Dale, Aug 07 2022 *)
PROG
(Haskell)
import Data.Char (digitToInt)
a034709 n = a034709_list !! (n-1)
a034709_list =
filter (\i -> i `mod` 10 > 0 && i `mod` (i `mod` 10) == 0) [1..]
-- Reinhard Zumkeller, Jun 19 2011
(Python)
A034709_list = [n for n in range(1, 1000) if n % 10 and not n % (n % 10)]
# Chai Wah Wu, Sep 18 2014
(PARI) for(n=1, 200, if(n%10, if(!(n%digits(n)[#Str(n)]), print1(n, ", ")))) \\ Derek Orr, Sep 19 2014
CROSSREFS
KEYWORD
nonn,base,easy,nice
AUTHOR
STATUS
approved