This site is supported by donations to The OEIS Foundation. Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A181796 a(n) = number of divisors of n whose canonical prime factorizations contain no repeated positive exponents (cf. A130091). 6
 1, 2, 2, 3, 2, 3, 2, 4, 3, 3, 2, 5, 2, 3, 3, 5, 2, 5, 2, 5, 3, 3, 2, 7, 3, 3, 4, 5, 2, 4, 2, 6, 3, 3, 3, 7, 2, 3, 3, 7, 2, 4, 2, 5, 5, 3, 2, 9, 3, 5, 3, 5, 2, 7, 3, 7, 3, 3, 2, 7, 2, 3, 5, 7, 3, 4, 2, 5, 3, 4, 2, 10, 2, 3, 5, 5, 3, 4, 2, 9, 5, 3, 2, 7, 3, 3, 3, 7, 2, 7, 3, 5, 3, 3, 3, 11, 2, 5, 5, 7, 2, 4, 2, 7, 4 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS The canonical factorization of n into prime powers can be written as Product p(i)^e(i), for example. A host of equivalent notations can also be used (for another example, see Weisstein link). a(n) depends only on prime signature of n (cf. A025487). a(n) >= A085082(n).  (A085082(n) equals the number of members of A025487 that divide A046523(n), and each member of A025487 is divisible by at least one member of A130091 that divides no smaller member of A025487.) a(n) > A085082(n) iff n has in its canonical prime factorization at least two exponents greater than 1. a(n) = number of such divisors of n that in their prime factorization all exponents are unique. - Antti Karttunen, May 27 2017 LINKS Antti Karttunen, Table of n, a(n) for n = 1..10000 Eric Weisstein's World of Mathematics, Prime Factorization FORMULA a(A000079(n)) = a(A002110(n)) = n+1. a(A006939(n)) = A000110(n+1). a(A181555(n)) = A002720(n). EXAMPLE 12 has a total of six divisors (1, 2, 3, 4, 6 and 12). Of those divisors, the number 1 has no prime factors, hence, no positive exponents at all (and no repeated positive exponents) in its canonical prime factorization. The lists of positive exponents for 2, 3, 4, 6 and 12 are (1), (1), (2), (1,1) and (2,1) respectively (cf. A124010). Of all six divisors, only the number 6 (2^1*3^1) has at least one positive exponent repeated (namely, 1).  The other five do not; hence, a(12) = 5. For n = 90 = 2 * 3^2 * 5, the divisors that satisfy the condition are: 1, 2, 3, 3^2, 5, 2 * 3^2, 3^2 * 5, altogether 7, (but for example 90 itself is not included), thus a(90) = 7. MATHEMATICA Table[DivisorSum[n, 1 &, Length@ Union@ # == Length@ # &@ FactorInteger[#][[All, -1]] &], {n, 105}] (* Michael De Vlieger, May 28 2017 *) PROG (PARI) no_repeated_exponents(n) = { my(es = factor(n)[, 2]); if(length(Set(es)) == length(es), 1, 0); } A181796(n) = sumdiv(n, d, no_repeated_exponents(d)); \\ Antti Karttunen, May 27 2017 (Python) from sympy import factorint, divisors def ok(n):     f=factorint(n)     ex=[f[i] for i in f]     for i in ex:         if ex.count(i)>1: return 0     return 1 def a(n): return sum([1 for i in divisors(n) if ok(i)]) # Indranil Ghosh, May 27 2017 CROSSREFS Diverges from A088873 at n=24 and from A085082 at n=36. a(36) = 7, while A085082(36) = 6. Sequence in context: A327394 A088873 A085082 * A319686 A326082 A067554 Adjacent sequences:  A181793 A181794 A181795 * A181797 A181798 A181799 KEYWORD nonn AUTHOR Matthew Vandermast, Nov 22 2010 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 September 21 19:59 EDT 2019. Contains 327282 sequences. (Running on oeis4.)