OFFSET
1,11
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
EXAMPLE
a(35)=1 because 5 is a divisor of 35 but 3 is not.
MAPLE
f:= proc(n) local L; L:= convert(n, base, 10);
nops(select(t -> t > 0 and n mod t = 0, L))
end proc:
map(f, [$1..1000]); # Robert Israel, Jul 04 2016
MATHEMATICA
Array[Count[Position[Most@ DigitCount@ #, _?(# > 0 &)][[All, 1]], k_ /; Mod[#, k] == 0] &, 105] (* Michael De Vlieger, Dec 23 2019 *)
Table[Count[n/Select[IntegerDigits[n], #>0&], _?IntegerQ], {n, 110}] (* Harvey P. Dale, Mar 04 2023 *)
PROG
(Haskell)
import Data.Char (digitToInt)
a038769 n = length $ filter (== 0)
$ map ((mod n) . digitToInt) $ filter (> '0') $ show n
-- Reinhard Zumkeller, Jun 19 2011
(Magma) [#[c:c in Intseq(k) |not IsZero(c) and k mod c eq 0]:k in [1..105]]; // Marius A. Burtea, Dec 23 2019
CROSSREFS
KEYWORD
nonn,base,easy
AUTHOR
Henry Bottomley, May 04 2000
STATUS
approved