login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Numbers not divisible by any of their digits nor by the sum of their digits.
1

%I #7 Oct 19 2016 15:10:04

%S 23,29,34,37,38,43,46,47,49,53,56,57,58,59,67,68,69,73,74,76,78,79,83,

%T 86,87,89,94,97,98,223,227,229,233,239,249,253,257,259,263,267,269,

%U 277,283,289,293,299,323,329,334,337,338,343,346,347,349,353,356

%N Numbers not divisible by any of their digits nor by the sum of their digits.

%D Amarnath Murthy

%H Harvey P. Dale, <a href="/A082943/b082943.txt">Table of n, a(n) for n = 1..1000</a>

%e 38 is neither divisible by 3 nor 8 nor 11 (i.e. 3+8).

%t test1[n_] := Module[{dig = IntegerDigits[n]}, Union[Table[IntegerQ[n/dig[[i]]], {i, Length[dig]}]]] == {False}; test2[n_] := Module[{dig = IntegerDigits[n]}, Not[IntegerQ[n/Sum[dig[[i]], {i, Length[dig]}]]]]; Table[If[test1[n] && test2[n], n, 0], {n, 200}] // Union // Rest [From _José María Grau Ribas_, Feb 17 2010]

%t ndQ[n_]:=Module[{idn=IntegerDigits[n]},FreeQ[idn,0]&&NoneTrue[n/ Join[ idn, {Total[idn]}],IntegerQ]]; Select[Range[2000],ndQ] (* Requires Mathematica version 10 or later *) (* _Harvey P. Dale_, Oct 19 2016 *)

%Y Cf. A038772.

%K nonn,base

%O 1,1

%A Meenakshi Srikanth (menakan_s(AT)yahoo.com), Apr 30 2003

%E More terms from _Harvey P. Dale_, Oct 19 2016