This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A182860 #16 Feb 16 2025 08:33:13 %S A182860 1,2,2,2,2,3,2,2,2,3,2,4,2,3,3,2,2,4,2,4,3,3,2,4,2,3,2,4,2,4,2,2,3,3, %T A182860 3,3,2,3,3,4,2,4,2,4,4,3,2,4,2,4,3,4,2,4,3,4,3,3,2,6,2,3,4,2,3,4,2,4, %U A182860 3,4,2,4,2,3,4,4,3,4,2,4,2,3,2,6,3,3,3,4,2,6,3,4,3,3,3,4,2,4,4,3,2,4,2,4,4 %N A182860 Number of distinct prime signatures represented among the unitary divisors of n. %C A182860 a(n) = number of members m of A025487 such that d(m^k) divides d(n^k) for all values of k. (Here d(n) represents the number of divisors of n, or A000005(n).) %C A182860 a(n) depends only on prime signature of n (cf. A025487). %H A182860 Antti Karttunen, <a href="/A182860/b182860.txt">Table of n, a(n) for n = 1..10000</a> %H A182860 Eric Weisstein's World of Mathematics, <a href="https://mathworld.wolfram.com/UnitaryDivisor.html">Unitary Divisor</a> %H A182860 <a href="/index/Eu#epf">Index entries for sequences computed from exponents in factorization of n</a> %F A182860 a(n) = A000005(A181819(n)). %F A182860 If the canonical factorization of n into prime powers is Product p^e(p), then the formula for d(n^k) is Product_p (ek + 1). (See also A146289, A146290.) %F A182860 a(n) = A064553(A328830(n)). - _Antti Karttunen_, Apr 29 2022 %e A182860 60 has 8 unitary divisors (1, 3, 4, 5, 12, 15, 20 and 60). Primes 3 and 5 have the same prime signature, as do 12 (2^2*3) and 20 (2^2*5); each of the other four numbers listed is the only unitary divisor of 60 with its particular prime signature. Since a total of 6 distinct prime signatures appear among the unitary divisors of 60, a(60) = 6. %t A182860 Table[Length@ Union@ Map[Sort[FactorInteger[#] /. {p_, e_} /; p > 0 :> If[p == 1, 0, e]] &, Select[Divisors@ n, CoprimeQ[#, n/#] &]], {n, 105}] (* _Michael De Vlieger_, Jul 19 2017 *) %o A182860 (PARI) %o A182860 A181819(n) = {my(f=factor(n)); prod(k=1, #f~, prime(f[k, 2])); }; \\ From A181819 %o A182860 A182860(n) = numdiv(A181819(n)); \\ _Antti Karttunen_, Jul 19 2017 %Y A182860 Cf. A000005, A034444, A064553, A085082, A146289, A146290, A182861, A182862, A212180, A328830. %K A182860 nonn %O A182860 1,2 %A A182860 _Matthew Vandermast_, Jan 14 2011