A057521 -id:A057521 - cp's OEIS frontend

A212172 Row n of table represents second signature of n: list of exponents >= 2 in canonical prime factorization of n, in nonincreasing order, or 0 if no such exponent exists.

0, 0, 0, 2, 0, 0, 0, 3, 2, 0, 0, 2, 0, 0, 0, 4, 0, 2, 0, 2, 0, 0, 0, 3, 2, 0, 3, 2, 0, 0, 0, 5, 0, 0, 0, 2, 2, 0, 0, 0, 3, 0, 0, 0, 2, 2, 0, 0, 4, 2, 2, 0, 2, 0, 3, 0, 3, 0, 0, 0, 2, 0, 0, 2, 6, 0, 0, 0, 2, 0, 0, 0, 3, 2, 0, 0, 2, 2, 0, 0, 0, 4, 4, 0, 0, 2, 0, 0

Offset: 1

Matthew Vandermast, Jun 03 2012

Length of row n equals A056170(n) if A056170(n) is positive, or 1 if A056170(n) = 0.
The multiset of exponents >=2 in the prime factorization of n completely determines a(n) for over 20 sequences in the database (see crossreferences). It also determines the fractions A034444(n)/A000005(n) and A037445(n)/A000005(n).
For squarefree numbers, this multiset is { } (the empty multiset). The use of 0 in the table to represent each n with no exponents >=2 in its prime factorization accords with the usual OEIS practice of using 0 to represent nonexistent elements when possible. In comments, the second signature of squarefree numbers will be represented as { }.
For each second signature {S}, there exist values of j and k such that, if the second signature of n is {S}, then A085082(n) is congruent to j modulo k.  These values are nontrivial unless {S} = { }. Analogous (but not necessarily identical) values of j and k also exist for each second signature with respect to A088873 and A181796.
Each sequence of integers with a given second signature {S} has a positive density, unlike the analogous sequences for prime signatures. The highest of these densities is 6/Pi^2 = 0.607927... for A005117 ({S} = { }).

			First rows of table read: 0; 0; 0; 2; 0; 0; 0; 3; 2; 0; 0; 2;...
12 = 2^2*3 has positive exponents 2 and 1 in its canonical prime factorization (1s are often left implicit as exponents). Since only exponents that are 2 or greater appear in a number's second signature, 12's second signature is {2}.
30 = 2*3*5 has no exponents greater than 1 in its prime factorization. The multiset of its exponents >= 2 is { } (the empty multiset), represented in the table with a 0.
72 = 2^3*3^2 has positive exponents 3 and 2 in its prime factorization, as does 108 = 2^2*3^3. Rows 72 and 108 both read {3,2}.

Jason Kimberley, Table of i, a(i) for i = 1..10575 (n = 1..10000)
M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy].
Primefan, The First 2500 Integers Factored (1st of 5 pages)

A181800 gives first integer of each second signature. Also see A212171, A212173-A212181, A212642-A212644.
Functions determined by exponents >=2 in the prime factorization of n:
Multiplicative: A000688, A005361, A008966, A038538, A046951, A049419, A050361, A050377, A056624, A061704, A063775, A162510, A162511, A212181.
Additive: A046660, A056170.
Other: A007424, A051903 (for n > 1), A056626, A066301, A071325, A072411, A091050, A107078, A185102 (for n > 1), A212180.
Sequences that contain all integers of a specific second signature: A005117 (second signature { }), A060687 ({2}), A048109 ({3}).

&cat[IsEmpty(e)select [0]else Reverse(Sort(e))where e is[pe[2]:pe in Factorisation(n)|pe[2]gt 1]:n in[1..102]]; // Jason Kimberley, Jun 13 2012

row[n_] := Select[ FactorInteger[n][[All, 2]], # >= 2 &] /. {} -> 0 /. {k__} -> Sequence[k]; Table[row[n], {n, 1, 100}] (* Jean-François Alcover, Apr 16 2013 *)

For nonsquarefree n, row n is identical to row A057521(n) of table A212171.

A323308 The number of exponential semiproper divisors of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 2, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1

Offset: 1

Amiram Eldar, Jan 10 2019

An exponential semiproper divisor of n is a divisor d such that rad(d) = rad(n) and gcd(d/rad(n), n/d) = 1, where rad(n) is the largest squarefree divisor of n (A007947).
a(n) is also the number of divisors of n that are squares of squarefree numbers (A062503). - Amiram Eldar, Oct 08 2022
a(n) is also the number of unitary divisors of n that are powerful (A001694). - Amiram Eldar, Feb 18 2023
The smallest integer that has exactly 2^n exponential semiproper divisors is A061742(n). - Bernard Schott, Feb 20 2023

Amiram Eldar, Table of n, a(n) for n = 1..10000
Nicusor Minculete, A new class of divisors: the exponential semiproper divisors, Bulletin of the Transilvania University of Brasov, Mathematics, Informatics, Physics, Series III, Vol. 7, No. 1 (2014), pp. 37-46.
Index entries for sequences computed from exponents in factorization of n.
Index entries for sequences related to divisors of numbers.

Cf. A000188, A001694, A007947, A008833, A034444, A057521, A061742, A062503, A082020, A323309, A323310.

f[p_, e_] := If[e==1, 1, 2]; a[1]=1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

a(n) = my(f=factor(n)); for (k=1, #f~, f[k,1] = min(f[k,2], 2); f[k,2] = 1); factorback(f); \\ Michel Marcus, Jan 11 2019

a(n) = A034444(n/A007947(n)).
Multiplicative with a(p^e) = 1 for e = 1 and 2 otherwise.
Asymptotic mean: Limit_{n->oo} (1/n) * Sum_{k=1..n} a(k) = 15/Pi^2 = 1.5198177546... (A082020). - Amiram Eldar, Nov 08 2020
a(n) = Sum_{d^2|n} mu(d)^2. - Wesley Ivan Hurt, Feb 13 2022
Dirichlet g.f.: zeta(s) * zeta(2*s) / zeta(4*s). - Werner Schulte, Dec 29 2022
a(n) = A034444(A000188(n)) = A034444(A008833(n)) (the number of unitary divisors of the largest square dividing n). - Amiram Eldar, Sep 03 2023
a(n) = A034444(A057521(n)) (the number of unitary divisors of the powerful part of n). - Amiram Eldar, Oct 03 2023

A332785 Nonsquarefree numbers that are not squareful.

Original entry on oeis.org

12, 18, 20, 24, 28, 40, 44, 45, 48, 50, 52, 54, 56, 60, 63, 68, 75, 76, 80, 84, 88, 90, 92, 96, 98, 99, 104, 112, 116, 117, 120, 124, 126, 132, 135, 136, 140, 147, 148, 150, 152, 153, 156, 160, 162, 164, 168, 171, 172, 175, 176, 180, 184, 188, 189, 192, 198, 204, 207, 208, 212, 220, 224

Offset: 1

Bernard Schott, Feb 24 2020

Sometimes nonsquarefree numbers are misnamed squareful numbers (see 1st comment of A013929). Indeed, every squareful number > 1 is nonsquarefree, but the converse is false. This sequence = A013929 \ A001694 and consists of these counterexamples.
This sequence is not a duplicate: the first 16 terms (<= 68) are the same first 16 terms of A059404, A323055, A242416 and A303946, then 72 is the 17th term of these 4 sequences. Also, the first 37 terms (<= 140) are the same first 37 terms of A317616 then 144 is the 38th term of this last sequence.
From Amiram Eldar, Sep 17 2023: (Start)
Called "hybrid numbers" by Jakimczuk (2019).
These numbers have a unique representation as a product of two numbers > 1, one is squarefree (A005117) and the other is powerful (A001694).
Equivalently, numbers k such that A055231(k) > 1 and A057521(k) > 1.
Equivalently, numbers that have in their prime factorization at least one exponent that is equal to 1 and at least one exponent that is larger than 1.
The asymptotic density of this sequence is 1 - 1/zeta(2) (A229099). (End)

			18 = 2 * 3^2 is nonsquarefree as it is divisible by the square 3^2, but it is not squareful because 2 divides 18 but 2^2 does not divide 18, hence 18 is a term.
72 = 2^3 * 3^2 is nonsquarefree as it is divisible by the square 3^2, but it is also squareful because primes 2 and 3 divide 72, and 2^2 and 3^2 divide also 72, so 72 is not a term.

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Rafael Jakimczuk, Powerful Numbers Multiple of a Set of Primes and Hybrid Numbers, 2019.

Cf. A005117 (squarefree), A013929 (nonsquarefree), A001694 (squareful), A052485 (not squareful).

Cf. A059404, A126706, A229099, A242416, A286708, A303946, A317616, A323055 (first terms are the same).

filter:= proc(n) local F;
 F:= ifactors(n)[2][..,2];
 max(F) > 1 and min(F) = 1
end proc:
select(filter, [$1..1000]); # Robert Israel, Sep 15 2024

Select[Range[225], Max[(e = FactorInteger[#][[;;,2]])] > 1 && Min[e] == 1 &] (* Amiram Eldar, Feb 24 2020 *)

isok(m) = !issquarefree(m) && !ispowerful(m); \\ Michel Marcus, Feb 24 2020

from math import isqrt
from sympy import mobius, integer_nthroot
def A332785(n):
    def squarefreepi(n): return int(sum(mobius(k)*(n//k**2) for k in range(1, isqrt(n)+1)))
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x):
        c, l, j = n-1+squarefreepi(integer_nthroot(x,3)[0])+squarefreepi(x), 0, isqrt(x)
        while j>1:
            k2 = integer_nthroot(x//j**2,3)[0]+1
            w = squarefreepi(k2-1)
            c += j*(w-l)
            l, j = w, isqrt(x//k2**3)
        return c-l
    return bisection(f,n,n) # Chai Wah Wu, Sep 14 2024

This sequence is A126706 \ A286708.

Sum_{n>=1} 1/a(n)^s = 1 + zeta(s) - zeta(s)/zeta(2*s) - zeta(2*s)*zeta(3*s)/zeta(6*s), s > 1. - Amiram Eldar, Sep 17 2023

A092261 Sum of unitary, squarefree divisors of n, including 1.

Original entry on oeis.org

1, 3, 4, 1, 6, 12, 8, 1, 1, 18, 12, 4, 14, 24, 24, 1, 18, 3, 20, 6, 32, 36, 24, 4, 1, 42, 1, 8, 30, 72, 32, 1, 48, 54, 48, 1, 38, 60, 56, 6, 42, 96, 44, 12, 6, 72, 48, 4, 1, 3, 72, 14, 54, 3, 72, 8, 80, 90, 60, 24, 62, 96, 8, 1, 84, 144, 68, 18, 96, 144, 72, 1, 74, 114, 4, 20, 96, 168, 80

Offset: 1

Steven Finch, Feb 20 2004

Unitary convolution of the sequence of n*mu^2(n) (absolute values of A055615) and A000012. - R. J. Mathar, May 30 2011

Michael De Vlieger, Table of n, a(n) for n = 1..10000
Eckford Cohen, Arithmetical functions associated with the unitary divisors of an integer, Math. Zeitschr. 74 (1960) 66-80, sequence sigma'(n).
Steven R. Finch, Unitarism and Infinitarism, February 25, 2004. [Cached copy, with permission of the author]

Cf. A000203, A003557, A007947, A048250, A055231, A056671, A057521, A065465, A295294, A295295, A329728.

Table[Plus @@ Select[Divisors@ n, Max @@ Last /@ FactorInteger@ # == 1 && GCD[#, n/#] == 1 &], {n, 1, 79}] (* Michael De Vlieger, Mar 08 2015 *)
f[p_, e_] := If[e==1, p+1, 1]; a[1]=1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 79] (* Amiram Eldar, Mar 01 2019 *)

a(n) = sumdiv(n, d, d*issquarefree(d)*(gcd(d, n/d) == 1)); \\ Michel Marcus, Mar 06 2015

for(n=1, 100, print1(direuler(p=2, n, (1 + p^2*X^3 - p*X^2 - p^2*X^2)/(1-X)/(1-p*X))[n], ", ")) \\ Vaclav Kotesovec, Aug 20 2021

;; This implementation utilizes the memoization-macro definec for which an implementation is available at http://oeis.org/wiki/Memoization#Scheme
;; The other functions, A020639, A067029 and A028234 can be found under the respective entries, and should likewise defined with definec:
(definec (A092261 n) (if (= 1 n) 1 (* (+ 1 (if (> (A067029 n) 1) 0 (A020639 n))) (A092261 (A028234 n))))) ;; Antti Karttunen, Nov 25 2017

Multiplicative with a(p) = p+1 and a(p^e) = 1 for e > 1. - Vladeta Jovovic, Feb 22 2004
From Álvar Ibeas, Mar 06 2015: (Start)
a(n) = a(A055231(n)) = A000203(A055231(n)).
Dirichlet g.f.: zeta(s) * Product_{p prime} (1 + p^(1-s) - p^(1-2s)).
(End)
From Antti Karttunen, Nov 25 2017: (Start)
a(n) = A048250(A055231(n)).
a(n) = A000203(n) / A295294(n).
a(n) = A048250(n) / A295295(n) = A048250(n) / A048250(A057521(n)), where A057521(n) = A064549(A003557(n)).
(End)
Lim_{n->oo} (1/n) * Sum_{k=1..n} a(k)/k = Product_{p prime}(1 - 1/(p^2*(p+1))) = 0.881513... (A065465). - Amiram Eldar, Jun 10 2020
Dirichlet g.f.: zeta(s) * zeta(s-1) * Product_{p prime} (1 + p^(2-3*s) - p^(1-2*s) - p^(2-2*s)). - Vaclav Kotesovec, Aug 20 2021
a(n) = Sum_{d|n, gcd(d,n/d)=1} d * mu(d)^2. - Wesley Ivan Hurt, May 26 2023

A280292 a(n) = sopfr(n) - sopf(n).

Original entry on oeis.org

0, 0, 0, 2, 0, 0, 0, 4, 3, 0, 0, 2, 0, 0, 0, 6, 0, 3, 0, 2, 0, 0, 0, 4, 5, 0, 6, 2, 0, 0, 0, 8, 0, 0, 0, 5, 0, 0, 0, 4, 0, 0, 0, 2, 3, 0, 0, 6, 7, 5, 0, 2, 0, 6, 0, 4, 0, 0, 0, 2, 0, 0, 3, 10, 0, 0, 0, 2, 0, 0, 0, 7, 0, 0, 5, 2, 0, 0, 0, 6, 9, 0, 0, 2, 0, 0, 0, 4, 0, 3, 0, 2, 0, 0, 0, 8, 0, 7, 3, 7, 0, 0, 0, 4, 0

Offset: 1

Michel Marcus, Dec 31 2016

nonn

Alladi and Erdős (1977) proved that for all numbers m>=0, m!=1, the sequence of numbers k such that a(k) = m has a positive asymptotic density which is equal to a rational multiple of 1/zeta(2) = 6/Pi^2 (A059956). For example, when m=0, the sequence is the squarefree numbers (A005117), whose density is 6/Pi^2, and when m=2 the sequence is A081770, whose density is 1/Pi^2. - Amiram Eldar, Nov 02 2020

Sum of prime factors minus sum of distinct prime factors. Counting partitions by this statistic (sum minus sum of distinct parts) gives A364916. - Gus Wiseman, Feb 21 2025

Jean-Marie De Koninck and Aleksandar Ivić, Topics in Arithmetical Functions: Asymptotic Formulae for Sums of Reciprocals of Arithmetical Functions and Related Fields, Amsterdam, Netherlands: North-Holland, 1980. See pp. 164-166.
Steven R. Finch, Mathematical Constants II, Encyclopedia of Mathematics and Its Applications, Cambridge University Press, Cambridge, 2018, p. 165.

Antti Karttunen, Table of n, a(n) for n = 1..20000
Krishnaswami Alladi and Paul Erdős, On an additive arithmetic function, Pacific Journal of Mathematics, Vol. 71, No. 2 (1977), pp. 275-294, alternative link.
Jean-Marie De Koninck, Paul Erdős and Aleksandar Ivić, Reciprocals of certain large additive functions, Canadian Mathematical Bulletin, Vol. 24, No. 2 (1981), pp. 225-231.
Aleksandar Ivić, On certain large additive functions, arXiv:math/0311505 [math.NT], 2003.

Cf. A001414 (sopfr), A008472 (sopf), A057521, A059956, A081770, A280163, A338559, A338560.
A multiplicative version is A003557, firsts A064549 (sorted A001694).
For length instead of sum we have A046660.
For product instead of sum we have A066503, firsts A381076.
Positions of first appearances are A280286 (sorted A381075).
For indices instead of factors we have A380955, firsts A380956 (sorted A380957).
For exponents instead of factors we have A380958, firsts A380989.
A000040 lists the primes, differences A001223.
A001222 counts prime factors (distinct A001221).
A003963 gives product of prime indices, distinct A156061, excess A380986.
A005117 lists squarefree numbers, complement A013929.
A007947 gives squarefree kernel.
A020639 gives least prime factor (index A055396), greatest A061395 (index A006530).
A027746 lists prime factors, distinct A027748.
A112798 lists prime indices (sum A056239), distinct A304038 (sum A066328).
Cf. A071625, A075255, A116861, A136565, A175508, A290106, A364916, A381077.

Array[Total@ # - Total@ Union@ # &@ Flatten[ConstantArray[#1, #2] & @@@ FactorInteger@ #] &, 105] (* Michael De Vlieger, Feb 25 2019 *)

sopfr(n) = my(f=factor(n)); sum(j=1, #f~, f[j, 1]*f[j, 2]);
sopf(n) = my(f=factor(n)); sum(j=1, #f~, f[j, 1]);
a(n) = sopfr(n) - sopf(n);

a(n) = A001414(n) - A008472(n).
a(A005117(n)) = 0.
a(n) = A001414(A003557(n)). - Antti Karttunen, Oct 07 2017
Additive with a(1) = 0 and a(p^e) = p*(e-1) for prime p and e > 0. - Werner Schulte, Feb 24 2019
From Amiram Eldar, Nov 02 2020: (Start)
a(n) = a(A057521(n)).
Sum_{n<=x} a(n) ~ x*log(log(x)) + O(x) (Alladi and Erdős, 1977).
Sum_{n<=x, n nonsquarefree} 1/a(n) ~ c*x + O(sqrt(x)*log(x)), where c = Integral_{t=0..1} (F(t)-6/Pi^2)/t dt, and F(t) = Product_{p prime} (1-1/p)*(1-1/(t^p - p)) (De Koninck et al., 1981; Finch, 2018), or, equivalently c = Sum_{k>=2} d(k)/k = 0.1039..., where d(k) = (6/Pi^2)*A338559(k)/A338560(k) is the asymptotic density of the numbers m with a(m) = k (Alladi and Erdős, 1977; Ivić, 2003). (End)

More terms from Antti Karttunen, Oct 07 2017

A291750 Compound filter: a(n) = P(A003557(n), A048250(n)), where P(n,k) is sequence A000027 used as a pairing function.

Original entry on oeis.org

1, 4, 7, 8, 16, 67, 29, 19, 18, 154, 67, 80, 92, 277, 277, 53, 154, 94, 191, 173, 497, 631, 277, 109, 50, 862, 75, 302, 436, 2557, 497, 169, 1129, 1432, 1129, 142, 704, 1771, 1541, 214, 862, 4561, 947, 668, 328, 2557, 1129, 179, 98, 236, 2557, 905, 1432, 199, 2557, 355, 3161, 4006, 1771, 2630, 1892, 4561, 564, 593, 3487, 10297, 2279, 1487, 4561, 10297, 2557

Offset: 1

Antti Karttunen, Sep 04 2017

nonn

A000203 (sigma(n)) is a function of this sequence, because formula
  A000203(n) = A092261(n) * A295294(n)
can be rewritten as a relation:
  A000203(n) = A000203(A057521(n)) * A048250(n) / A048250(A057521(n)),
where A057521(n) = A064549(A003557(n)), thus A000203(n) is a function of A003557(n) and A048250(n), the values that are packed here into a(n).
A001615 (Dedekind's psi) is a function of this sequence, because it can be written as A001615(n) = A003557(n)*A048250(n).

Antti Karttunen, Table of n, a(n) for n = 1..10000

Cf. A000027, A000203, A001615, A003557, A048250, A291751 (rgs-version of this filter).

A003557(n) = n/factorback(factor(n)[, 1]); \\ This function from Charles R Greathouse IV, Nov 17 2014
A048250(n) = if(n<1, 0, sumdiv(n, d, if(core(d)==d, d)));
A291750(n) = (1/2)*(2 + ((A003557(n)+A048250(n))^2) - A003557(n) - 3*A048250(n));

a(n) = (1/2)*(2 + ((A003557(n) + A048250(n))^2) - A003557(n) - 3*A048250(n)).

A335275 Numbers k such that the largest square dividing k is a unitary divisor of k.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 28, 29, 30, 31, 33, 34, 35, 36, 37, 38, 39, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 55, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 73, 74, 75, 76

Offset: 1

Amiram Eldar, Jul 06 2020

nonn

Numbers k such that gcd(A008833(k), k/A008833(k)) = 1.
Numbers whose prime factorization contains exponents that are either 1 or even.
Numbers whose powerful part (A057521) is a square.
First differs from A220218 at n = 227: a(227) = 256 is not a term of A220218.
The asymptotic density of this sequence is Product_{p prime} (1 - 1/(p^2*(p+1))) = 0.881513... (A065465).
Complement of A295661. - Vaclav Kotesovec, Jul 07 2020
Differs from A096432 in having or not having 1, 256, 432, 648, 768, 1280, 1728, 1792, 2000, 2160, 2304,... - R. J. Mathar, Jul 22 2020
Equivalently, numbers k whose squarefree part (A007913) is a unitary divisor, or gcd(A007913(k), A008833(k)) = 1. - Amiram Eldar, Oct 09 2022

			12 is a term since the largest square dividing 12 is 4, and 4 and 12/4 = 3 are coprime.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Eckford Cohen, Some asymptotic formulas in the theory of numbers, Trans. Amer. Math. Soc., Vol. 112, No. 2 (1964), pp. 214-227. See corollary 3.1.2, p. 222.

A000290, A138302 and A220218 are subsequences.

Cf. A007913, A008833, A057521, A065465, A295661.

seqQ[n_] := AllTrue[FactorInteger[n][[;; , 2]], # == 1 || EvenQ[#] &];  Select[Range[100], seqQ]

isok(k) = my(d=k/core(k)); gcd(d, k/d) == 1; \\ Michel Marcus, Jul 07 2020

A337050 Numbers without an exponent 2 in their prime factorization.

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 8, 10, 11, 13, 14, 15, 16, 17, 19, 21, 22, 23, 24, 26, 27, 29, 30, 31, 32, 33, 34, 35, 37, 38, 39, 40, 41, 42, 43, 46, 47, 48, 51, 53, 54, 55, 56, 57, 58, 59, 61, 62, 64, 65, 66, 67, 69, 70, 71, 73, 74, 77, 78, 79, 80, 81, 82, 83, 85, 86, 87

Offset: 1

Amiram Eldar, Aug 12 2020

Numbers k such that the powerful part (A057521) of k is a cubefull number (A036966).
Numbers k such that A003557(k) = k/A007947(k) is a powerful number (A001694).
The asymptotic density of this sequence is Product_{primes p} (1 - 1/p^2 + 1/p^3) = 0.748535... (A330596).
A304364 is apparently a subsequence.
These numbers were named semi-2-free integers by Suryanarayana (1971). - Amiram Eldar, Dec 29 2020

			6 = 2^1 * 3^1 is a term since none of the exponents in its prime factorization is equal to 2.
9 = 3^2 is not a term since it has an exponent 2 in its prime factorization.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Ertan Elma and Greg Martin, Distribution of the number of prime factors with a given multiplicity, Canadian Mathematical Bulletin, Vol. 67, No. 4 (2024), pp. 1107-1122; arXiv preprint, arXiv:2406.04574 [math.NT], 2024.
D. Suryanarayana, Semi-k-free integers, Elemente der Mathematik, Vol. 26 (1971), pp. 39-40.
D. Suryanarayana and R. Sitaramachandra Rao, Distribution of semi-k-free integers, Proceedings of the American Mathematical Society, Vol. 37, No. 2 (1973), pp. 340-346.

Complement of A038109.
Cf. A003557, A007947, A057521, A304364, A330596.
A005117, A036537, A036966, A048109, A175496, A268335 and A336590 are subsequences.
Numbers without an exponent k in their prime factorization: A001694 (k=1), this sequence (k=2), A386799 (k=3), A386803 (k=4), A386807 (k=5).
Numbers that have exactly m exponents in their prime factorization that are equal to 2: this sequence (m=0), A386796 (m=1), A386797 (m=2), A386798 (m=3).

q:= n-> andmap(i-> i[2]<>2, ifactors(n)[2]):
select(q, [$1..100])[];  # Alois P. Heinz, Aug 12 2020

Select[Range[100], !MemberQ[FactorInteger[#][[;;, 2]], 2] &]

is(n) = {my(f = factor(n)); for(i = 1, #f~, if(f[i, 2] == 2, return(0))); 1; } \\ Amiram Eldar, Oct 21 2023

Sum_{n>=1} 1/a(n)^s = zeta(s) * Product_{p prime} (1 - 1/p^(2*s) + 1/p^(3*s)), for s > 1. - Amiram Eldar, Oct 21 2023

A056671 1 + the number of unitary and squarefree divisors of n = number of divisors of reduced squarefree part of n.

Original entry on oeis.org

1, 2, 2, 1, 2, 4, 2, 1, 1, 4, 2, 2, 2, 4, 4, 1, 2, 2, 2, 2, 4, 4, 2, 2, 1, 4, 1, 2, 2, 8, 2, 1, 4, 4, 4, 1, 2, 4, 4, 2, 2, 8, 2, 2, 2, 4, 2, 2, 1, 2, 4, 2, 2, 2, 4, 2, 4, 4, 2, 4, 2, 4, 2, 1, 4, 8, 2, 2, 4, 8, 2, 1, 2, 4, 2, 2, 4, 8, 2, 2, 1, 4, 2, 4, 4, 4, 4, 2, 2, 4, 4, 2, 4, 4, 4, 2, 2, 2, 2, 1, 2, 8, 2, 2, 8

Offset: 1

Labos Elemer, Aug 10 2000

Note that 1 is regarded as free of squares of primes and is also a square number and a unitary divisor.

			n = 252 = 2*2*3*3*7 has 18 divisors, 8 unitary and 8 squarefree divisors of which 2 are unitary and squarefree, divisors {1,7};
n = 2520 = 2*2*2*3*3*5*7 has 48 divisors, 16 unitary and 16 squarefree divisors of which {1,5,7,35} are both, thus a(2520) = 4.
a(2520) = a(2^3*3^2*5*7) = a(2^3)*a(3^2)*a(5)*a(7) = 1*1*2*2 = 4.

Antti Karttunen, Table of n, a(n) for n = 1..10000
Steven R. Finch, Unitarism and Infinitarism, February 25, 2004. [Cached copy, with permission of the author]
Index entries for sequences computed from exponents in factorization of n.

Cf. A000005, A007913, A034444, A055229, A055231, A056169, A056674.

Cf. A343443.

Array[DivisorSigma[0, #] &@ Denominator[#/Apply[Times, FactorInteger[#][[All, 1]]]^2] &, 105] (* or *)
Table[DivisorSum[n, 1 &, And[SquareFreeQ@ #, CoprimeQ[#, n/#]] &], {n, 105}] (* Michael De Vlieger, Jul 19 2017 *)
f[p_,e_] := If[e==1, 2, 1]; a[1] = 1; a[n_] := Times @@ (f @@@ FactorInteger[n]); Array[a, 100] (* Amiram Eldar, May 14 2019 *)

A057521(n) = { my(f=factor(n)); prod(i=1, #f~, if(f[i, 2]>1, f[i, 1]^f[i, 2], 1)); } \\ Charles R Greathouse IV, Aug 13 2013
A055231(n) = n/A057521(n);
A056671(n) = numdiv(A055231(n));
\\ Or:
A055229(n) = { my(c=core(n)); gcd(c, n/c); }; \\ This function from Charles R Greathouse IV, Nov 20 2012
A056671(n) = numdiv(core(n)/A055229(n)); \\ Antti Karttunen, Jul 19 2017

for(n=1, 100, print1(direuler(p=2, n, (1 + X - X^2)/(1-X))[n], ", ")) \\ Vaclav Kotesovec, Feb 11 2023

a(n) = vecprod(apply(x -> if(x == 1, 2, 1), factor(n)[, 2])); \\ Amiram Eldar, Apr 15 2025

from sympy import factorint, prod
def a(n): return 1 if n==1 else prod([2 if e==1 else 1 for p, e in factorint(n).items()])
print([a(n) for n in range(1, 51)]) # Indranil Ghosh, Jul 19 2017

(define (A056671 n) (if (= 1 n) n (* (if (= 1 (A067029 n)) 2 1) (A056671 (A028234 n))))) ;; (After the given multiplicative formula) - Antti Karttunen, Jul 19 2017

a(n) = A000005(A055231(n)) = A000005(A007913(n)/A055229(n)).
Multiplicative with a(p) = 2 and a(p^e) = 1 for e > 1. a(n) = 2^A056169(n). - Vladeta Jovovic, Nov 01 2001
a(n) = A034444(n) - A056674(n). - Antti Karttunen, Jul 19 2017
From Vaclav Kotesovec, Feb 11 2023: (Start)
Dirichlet g.f.: zeta(s) * Product_{primes p} (1 + 1/p^s - 1/p^(2*s)).
Dirichlet g.f.: zeta(s)^2 * Product_{primes p} (1 - 2/p^(2*s) + 1/p^(3*s)), (with a product that converges for s=1).
Let f(s) = Product_{primes p} (1 - 2/p^(2*s) + 1/p^(3*s)), then Sum_{k=1..n} a(k) ~ n * (f(1) * (log(n) + 2*gamma - 1) + f'(1)), where f(1) = Product_{primes p} (1 - 2/p^2 + 1/p^3) = A065464 = 0.42824950567709444021876..., f'(1) = f(1) * Sum_{primes p} (4*p-3) * log(p) / (p^3 - 2*p + 1) = 0.808661108949590913395... and gamma is the Euler-Mascheroni constant A001620. (End)
a(n) = Sum_{d|n, gcd(d,n/d)=1} mu(d)^2. - Wesley Ivan Hurt, May 25 2023
a(n) = Sum_{d|n} A343443(d)*mu(n/d). - Ridouane Oudra, Dec 18 2023

A275812 Sum of exponents larger than one in the prime factorization of n: A001222(n) - A056169(n).

Original entry on oeis.org

0, 0, 0, 2, 0, 0, 0, 3, 2, 0, 0, 2, 0, 0, 0, 4, 0, 2, 0, 2, 0, 0, 0, 3, 2, 0, 3, 2, 0, 0, 0, 5, 0, 0, 0, 4, 0, 0, 0, 3, 0, 0, 0, 2, 2, 0, 0, 4, 2, 2, 0, 2, 0, 3, 0, 3, 0, 0, 0, 2, 0, 0, 2, 6, 0, 0, 0, 2, 0, 0, 0, 5, 0, 0, 2, 2, 0, 0, 0, 4, 4, 0, 0, 2, 0, 0, 0, 3, 0, 2, 0, 2, 0, 0, 0, 5, 0, 2, 2, 4, 0, 0, 0, 3, 0, 0, 0, 5, 0, 0, 0, 4, 0, 0, 0, 2, 2, 0, 0, 3

Offset: 1

Antti Karttunen, Aug 11 2016

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences computed from exponents in factorization of n.

Cf. A001222, A001694, A005117, A028234, A046660, A056169, A056170, A057521, A067029, A247180.
Differs from A212172 for the first time at n=36, where a(36)=4, while A212172(36)=2.
Cf. A085548, A136141.

Table[Total@ Map[Last, Select[FactorInteger@ n, Last@ # > 1 &] /. {} -> {{0, 0}}], {n, 120}] (* Michael De Vlieger, Aug 11 2016 *)

a(n) = my(f = factor(n)); sum(k=1, #f~, if (f[k,2] > 1, f[k,2])); \\ Michel Marcus, Jul 19 2017

sub a275812 { vecsum( grep {$> 1} map {$->[1]} factor_exp(shift) ); } # Dana Jacobsen, Aug 15 2016

from sympy import factorint, primefactors
def a001222(n):
    return 0 if n==1 else a001222(n//primefactors(n)[0]) + 1
def a056169(n):
    f=factorint(n)
    return 0 if n==1 else sum(1 for i in f if f[i]==1)
def a(n):
    return a001222(n) - a056169(n)
print([a(n) for n in range(1, 101)]) # Indranil Ghosh, Jun 19 2017

a(1) = 0, and for n > 1, if A067029(n)=1 [when n is one of the terms of A247180], a(n) = a(A028234(n)), otherwise a(n) = A067029(n)+a(A028234(n)).
a(n) = A001222(n) - A056169(n).
a(n) = A001222(A057521(n)). - Antti Karttunen, Jul 19 2017
From Amiram Eldar, Sep 28 2023: (Start)
Additive with a(p) = 0, and a(p^e) = e for e >= 2.
a(n) >= 0, with equality if and only if n is squarefree (A005117).
a(n) <= A001222(n), with equality if and only if n is powerful (A001694).
Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Sum_{p prime} (1/p^2 + 1/(p*(p-1))) = A085548 + A136141 = 1.22540408909086062637... . (End)
a(n) = A046660(n) + A056170(n). - Amiram Eldar, Jan 09 2024

cp's OEIS Frontend

A212172 Row n of table represents second signature of n: list of exponents >= 2 in canonical prime factorization of n, in nonincreasing order, or 0 if no such exponent exists.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A323308 The number of exponential semiproper divisors of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A332785 Nonsquarefree numbers that are not squareful.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Python

Formula

A092261 Sum of unitary, squarefree divisors of n, including 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Scheme

Formula

A280292 a(n) = sopfr(n) - sopf(n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A291750 Compound filter: a(n) = P(A003557(n), A048250(n)), where P(n,k) is sequence A000027 used as a pairing function.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A335275 Numbers k such that the largest square dividing k is a unitary divisor of k.

Views

Author

Keywords

Comments

Examples