This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A038769 Number of digits of n which are divisors of n. 7
 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 2, 0, 2, 1, 1, 0, 1, 0, 1, 1, 1, 2, 0, 1, 2, 0, 0, 1, 1, 1, 1, 0, 2, 1, 0, 0, 2, 0, 1, 1, 1, 0, 0, 2, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 2, 0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 2, 0, 0, 1, 1, 1, 0, 1, 1, 0, 0, 2, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 2, 1, 2, 2, 1, 2, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,11 COMMENTS a(A038772(n)) = 0; a(A038770(n)) > 0. 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 PROG (Haskell) import Data.Char (digitToInt) a038769 n = length \$ filter (== 0)             \$ map ((mod n) . digitToInt) \$ filter (> '0') \$ show n -- Reinhard Zumkeller, Jun 19 2011 CROSSREFS Cf. A034709, A034837, A038770, A038772. Sequence in context: A274274 A072550 A037810 * A255481 A241418 A117229 Adjacent sequences:  A038766 A038767 A038768 * A038770 A038771 A038772 KEYWORD base,easy,nonn AUTHOR Henry Bottomley, May 04 2000 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified August 18 01:14 EDT 2019. Contains 326059 sequences. (Running on oeis4.)