A212181 -id:A212181 - 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.

A365401 The number of divisors of the largest unitary divisor of n that is a square.

Original entry on oeis.org

1, 1, 1, 3, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 5, 1, 3, 1, 3, 1, 1, 1, 1, 3, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 9, 1, 1, 1, 1, 1, 1, 1, 3, 3, 1, 1, 5, 3, 3, 1, 3, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 3, 7, 1, 1, 1, 3, 1, 1, 1, 3, 1, 1, 3, 3, 1, 1, 1, 5, 5, 1, 1, 3, 1, 1, 1

Offset: 1

Amiram Eldar, Sep 03 2023

First differs from A212181 at n = 32.
The sum of these divisors is A351568(n).
All the terms are odd.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Vaclav Kotesovec, Graph - the asymptotic ratio (100000 terms)

Cf. A000005, A000290, A212181, A268335 A350388, A351568, A365402.

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

a(n) = vecprod(apply(x -> if(x%2, 1, x+1), factor(n)[, 2]));

a(n) = A000005(A350388(n)).
a(n) = A000005(n) / A365402(n).
a(n) <= A000005(n) with equality if and only if n is a square (A000290).
a(n) >= 1 with equality if and only if n is an exponentially odd number (A268335).
Multiplicative with a(p^e) = 1 if e is odd, and e+1 if e is even.
Dirichlet g.f.: zeta(2*s)^2 * Product_{p prime} (1 + 1/p^s + 1/p^(2*s) - 1/p^(3*s)).
From Vaclav Kotesovec, Sep 05 2023: (Start)
Dirichlet g.f.: zeta(s) * zeta(2*s)^2 * Product_{p prime} (1 - 2/p^(3*s) + 1/p^(4*s)).
Let f(s) = Product_{p prime} (1 - 2/p^(3*s) + 1/p^(4*s)).
Sum_{k=1..n} a(k) ~ f(1) * Pi^4 * n / 36 + sqrt(n) * zeta(1/2) * f(1/2)/2 * (log(n) + 4*gamma - 2 + zeta'(1/2)/zeta(1/2) + f'(1/2)/f(1/2)), where
f(1) = Product_{p prime} (1 - 2/p^3 + 1/p^4) = 0.7446954979060674204391238715944543281179691329049241118630718137015097502...,
f(1/2) = Product_{p prime} (1 - 2/p^(3/2) + 1/p^2) = 0.2312522106782016049013780988087017618011735848676872392115785564006277675...,
f'(1/2) = f(1/2) * Sum_{p prime} 2*(3*sqrt(p) - 2) * log(p) / (1 - 2*sqrt(p) + p^2) = f(1/2) * 6.937179176924511608542644054340717439502789953858512457656... and gamma is the Euler-Mascheroni constant A001620. (End)

A331286 Odd part of number of divisors of primorial inflation of n: a(n) = A000265(A329605(n)).

Original entry on oeis.org

1, 1, 1, 3, 1, 3, 1, 1, 9, 3, 1, 1, 1, 3, 9, 5, 1, 3, 1, 1, 9, 3, 1, 5, 27, 3, 1, 1, 1, 3, 1, 3, 9, 3, 27, 15, 1, 3, 9, 5, 1, 3, 1, 1, 1, 3, 1, 3, 81, 9, 9, 1, 1, 5, 27, 5, 9, 3, 1, 15, 1, 3, 1, 7, 27, 3, 1, 1, 9, 9, 1, 9, 1, 3, 3, 1, 81, 3, 1, 3, 25, 3, 1, 15, 27, 3, 9, 5, 1, 5, 81, 1, 9, 3, 27, 7, 1, 27, 1, 45, 1, 3, 1, 5, 3

Offset: 1

Antti Karttunen, Jan 14 2020

nonn

Antti Karttunen, Table of n, a(n) for n = 1..10000
Antti Karttunen, Data supplement: n, a(n) computed for n = 1..65537

Cf. A000265, A108951, A212181, A329605.

Cf. also A322865.

A331286(n) = if(1==n,1,my(f=factor(n),e=1,m=1); forstep(i=#f~,1,-1, e += f[i,2]; m *= (e>>valuation(e,2))^(primepi(f[i,1])-if(1==i,0,primepi(f[i-1,1])))); (m));

a(n) = A000265(A329605(n)).

a(n) = A212181(A108951(n)).

A212183 Largest odd divisor of A002183(n) (number of divisors of n-th highly composite number).

Original entry on oeis.org

1, 1, 3, 1, 3, 1, 9, 5, 3, 1, 9, 5, 3, 15, 1, 9, 5, 3, 15, 1, 9, 5, 21, 45, 3, 25, 27, 15, 1, 9, 5, 21, 45, 3, 25, 27, 7, 15, 1, 9, 5, 21, 45, 3, 25, 27, 7, 15, 63, 1, 9, 75, 5, 21, 45, 3, 25, 27, 7, 15, 63, 1, 9, 75, 5, 21, 45, 3, 25, 105, 27, 7, 15, 63, 1, 9

Offset: 1

Matthew Vandermast, Jun 08 2012

nonn

The "odd part" (largest odd divisor) of the number of divisors of n is a function of the exponents >=2 in the prime factorization of n (cf. A212172, A212181).

The number 1 appears a total of 18 times (see Graeme link for proof). Ramanujan proved that no number appears an infinite number of times (see Ramanujan link). It would be interesting to know more about a) which odd numbers appear in the sequence and b) how many times a number of a given size can appear in the sequence. See also A160233.

			The highly composite number 48 has a total of 10 divisors. Since 48 = A002182(8), A002183(8) = 10. Since the largest odd divisor of 10 is 5, a(8) = 5.

Amiram Eldar, Table of n, a(n) for n = 1..10000
A. Flammenkamp, List of the first 1200 highly composite numbers
Graeme McRae, Highly Composite Numbers
S. Ramanujan, Highly Composite Numbers (p. 34).
S. Ramanujan, Highly composite numbers, Proc. Lond. Math. Soc. 14 (1915), 347-409; reprinted in Collected Papers, Ed. G. H. Hardy et al., Cambridge 1927; Chelsea, NY, 1962.

Cf. A000265, A002182, A002183, A212181.

A160233 gives the n-th integer that is the largest member of A002183 with its particular odd part.

a(n) = A000265(A002183(n)) = A212181(A002182(n)).

A212641 Largest odd divisor of A212640(n) (number of divisors of n-th powerful number that is the first integer of its prime signature).

Original entry on oeis.org

1, 3, 1, 5, 3, 9, 7, 3, 1, 15, 1, 9, 9, 5, 5, 21, 3, 27, 11, 3, 25, 7, 9, 3, 27, 15, 1, 45, 13, 15, 35, 3, 9, 27, 9, 7, 33, 5, 15, 5, 63, 21, 15, 9, 45, 9, 1, 11, 9, 3, 75, 1, 39, 25, 21, 81, 49, 5, 3, 81, 27, 45, 17, 21, 55, 3, 27, 7, 3, 13, 45, 15, 105, 9, 45

Offset: 1

Matthew Vandermast, Jun 09 2012

nonn

The odd part of d(n), or largest odd divisor of d(n) (A212181(n)), is a function of the second signature of n (cf. A212172).  Since A181800 gives the first integer of each second signature, this sequence gives the value of A212181 for each second signature in order of its first appearance.
Note: The odd part of d(n) is not the same as the number of odd divisors of n (A001227(n)).
Each odd integer appears an infinite number of times.

			A181800(5) = 32 has 6 divisors (1, 2, 4, 8, 16 and 32).  The largest odd divisor of 6 is 3. Hence, a(5) = 3.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A000005, A000265, A181800, A212172, A212181, A212640.

a(n) = A000265(A212640(n)) = A212181(A181800(n)).

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

A365401 The number of divisors of the largest unitary divisor of n that is a square.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A331286 Odd part of number of divisors of primorial inflation of n: a(n) = A000265(A329605(n)).

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A212183 Largest odd divisor of A002183(n) (number of divisors of n-th highly composite number).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A212641 Largest odd divisor of A212640(n) (number of divisors of n-th powerful number that is the first integer of its prime signature).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula