cp's OEIS Frontend

A171492 Numbers that are not divisible by each of their nonzero decimal digits.

%I A171492 #26 Sep 08 2022 08:45:50
%S A171492 13,14,16,17,18,19,21,23,25,26,27,28,29,31,32,34,35,37,38,39,41,42,43,
%T A171492 45,46,47,49,51,52,53,54,56,57,58,59,61,62,63,64,65,67,68,69,71,72,73,
%U A171492 74,75,76,78,79,81,82,83,84,85,86,87,89,91,92,93,94,95,96,97,98,103,106
%N A171492 Numbers that are not divisible by each of their nonzero decimal digits.
%C A171492 Complement of A002796.
%C A171492 A067458(a(n)) > 0. - _Reinhard Zumkeller_, Sep 24 2015
%H A171492 Reinhard Zumkeller, <a href="/A171492/b171492.txt">Table of n, a(n) for n = 1..10000</a>
%H A171492 <a href="/index/Ar#10-automatic">Index entries for 10-automatic sequences</a>.
%F A171492 a(n) ~ k*n, where k = 2520/2519 = 1.00039.... - _Charles R Greathouse IV_, Feb 13 2017
%t A171492 a[c_]:=Module[{b=DeleteCases[IntegerDigits[c], 0]}, !And@@Divisible[c, b]]; Select[Range[250], a] (* _Metin Sariyar_, Sep 14 2019 *)
%o A171492 (Haskell)
%o A171492 import Data.List (nub, sort); import Data.Char (digitToInt)
%o A171492 a171492 n = a171492_list !! (n-1)
%o A171492 a171492_list = filter f [1..] where
%o A171492    f x = any ((> 0) . mod x) ds where
%o A171492      ds = map digitToInt (if c == '0' then cs else cs')
%o A171492      cs'@(c:cs) = nub $ sort $ show x
%o A171492 -- _Reinhard Zumkeller_, Jan 01 2014
%o A171492 (Magma) sol:=[];for k in [1..120] do a:=Set(Intseq(k)) diff {0}; if #[c:c in a|IsIntegral(k/c)] ne #a then; Append(~sol,k); end if; end for; sol; // _Marius A. Burtea_, Sep 09 2019
%Y A171492 Cf. A002796, A034838, A067458.
%K A171492 nonn,base,easy
%O A171492 1,1
%A A171492 _Jaroslav Krizek_, Dec 10 2009