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”).
%I #15 Sep 02 2014 11:12:54
%S 0,31,244,2012,16831,142224,1212521,10412937,89964007,781192156,
%T 6812648578,59632654665,523659800584,4611408084221,40708677441051,
%U 360148330033068,3192319968308509,28344332639409466,252044515540416543,2244223537121190033,20006367211775121313
%N a(n) = number of n-digit numbers not divisible by any of their digits.
%C Numbers ending in 0 are ignored.
%H Hiroaki Yamanouchi, <a href="/A147963/b147963.txt">Table of n, a(n) for n = 1..100</a>
%t a[n_] := (c = 0; Do[id = IntegerDigits[i]; Le = Length[id]; pr = Product[If[id[[k]] > 0, Mod[i, id[[k]]], 1], {k, Le}]; If[Mod[i, 10]*pr > 0,(*Print[n];*)c++ ], {i, 10^(n - 1), 10^n - 1}]; c); a[1] = 0; Table[a[m], {m, 8}]
%Y Cf. A038772 Numbers not divisible by any of their digits.
%K nonn,base
%O 1,2
%A _Zak Seidov_, Nov 17 2008
%E a(10)-a(11) from _Sean A. Irvine_, Nov 11 2010
%E a(12) from _Donovan Johnson_, Nov 14 2010
%E a(13)-a(21) from _Hiroaki Yamanouchi_, Aug 31 2014