This site is supported by donations to The OEIS Foundation.

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A093640 Number of divisors of n whose binary representation is contained in that of n. 4
 1, 2, 2, 3, 2, 4, 2, 4, 2, 4, 2, 6, 2, 4, 3, 5, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 3, 6, 2, 6, 2, 6, 2, 4, 2, 6, 2, 4, 3, 8, 2, 4, 2, 6, 4, 4, 2, 10, 2, 4, 3, 6, 2, 6, 4, 8, 3, 4, 2, 9, 2, 4, 4, 7, 2, 4, 2, 6, 2, 4, 2, 8, 2, 4, 4, 6, 2, 6, 2, 10, 2, 4, 2, 6, 3, 4, 3, 8, 2, 8, 3, 6, 3, 4, 3, 12, 2, 4, 3, 6, 2 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS a(n)>1 for n>1; a(p) =2 for primes p. a(A093641(n)) =A000005(A093641(n)), a(A093642(n)) < A000005(A093642(n)). LINKS Reinhard Zumkeller, Table of n, a(n) for n = 1..10000 EXAMPLE n=18: divisors of 18: 1='1', 2='10', 3='11', 6='110', 9='1001' and 18='10010': four of them are binary substrings of '10010', therefore a(18) =4. PROG (Haskell) import Data.List (isInfixOf) a093640 n  = length [d | d <- [1..n], mod n d == 0,                          show (a007088 d) `isInfixOf` show (a007088 n)] -- Reinhard Zumkeller, Jan 22 2012 CROSSREFS Cf. A078822, A007088. Sequence in context: A043261 A157986 A025479 * A320538 A083903 A083867 Adjacent sequences:  A093637 A093638 A093639 * A093641 A093642 A093643 KEYWORD nonn AUTHOR Reinhard Zumkeller, Apr 07 2004 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 January 19 05:21 EST 2019. Contains 319304 sequences. (Running on oeis4.)