A309307 -id:A309307 - cp's OEIS frontend

A383156 The sum of the maximum exponents in the prime factorizations of the divisors of n.

0, 1, 1, 3, 1, 3, 1, 6, 3, 3, 1, 7, 1, 3, 3, 10, 1, 7, 1, 7, 3, 3, 1, 13, 3, 3, 6, 7, 1, 7, 1, 15, 3, 3, 3, 13, 1, 3, 3, 13, 1, 7, 1, 7, 7, 3, 1, 21, 3, 7, 3, 7, 1, 13, 3, 13, 3, 3, 1, 15, 1, 3, 7, 21, 3, 7, 1, 7, 3, 7, 1, 22, 1, 3, 7, 7, 3, 7, 1, 21, 10, 3, 1

Offset: 1

Amiram Eldar, Apr 18 2025

Inverse Möbius transform of A051903.

a(n) depends only on the prime signature of n (A118914).

			4 has 3 divisors: 1, 2 = 2^1 and 4 = 2^2. The maximum exponents in their prime factorizations are 0, 1 and 2, respectively. Therefore, a(4) = 0 + 1 + 2 = 3.
12 has 6 divisors: 1, 2 = 2^1, 3 = 3^1, 4 = 2^2, 6 = 2 * 3 and 12 = 2^2 * 3. The maximum exponents in their prime factorizations are 0, 1, 1, 2, 1 and 2, respectively. Therefore, a(12) = 0 + 1 + 1 + 2 + 1 + 2 = 7.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Amiram Eldar, Plot of Sum_{k=1..n} a(k)/(c_1*n*log(n) + c_2*n) - 1 for n = 10^(1..10).

Cf. A000005, A001221, A005117, A034444, A051903, A073184, A118914, A252505, A309307, A383157, A383158, A383159.

Cf. A001620, A013661, A033150, A306016.

emax[n_] := If[n == 1, 0, Max[FactorInteger[n][[;; , 2]]]]; a[n_] := DivisorSum[n, emax[#] &]; Array[a, 100]
(* second program: *)
a[n_] := If[n == 1, 0, Module[{e = FactorInteger[n][[;; , 2]], emax, v}, emax = Max[e]; v = Table[Times @@ (Min[# + 1, k + 1] & /@ e), {k, 1, emax}]; v[[1]] + Sum[k*(v[[k]] - v[[k - 1]]), {k, 2, emax}] - 1]]; Array[a, 100]

emax(n) = if(n == 1, 0, vecmax(factor(n)[,2]));
a(n) = sumdiv(n, d, emax(d));

a(n) = if(n == 1, 0, my(e = factor(n)[, 2], emax = vecmax(e), v); v = vector(emax, k, vecprod(apply(x ->min(x+1 , k+1), e))); v[1] + sum(k = 2, emax, k * (v[k]-v[k-1])) - 1);

a(n) = Sum_{d|n} A051903(d).
a(n) = A000005(n) * A383157(n)/A383158(n).
a(p^e) = e*(e+1)/2 for prime p and e >= 0. In particular, a(p) = 1 for prime p.
a(n) = 2^omega(n) - 1 = A309307(n) if n is squarefree (A005117).
a(n) = tau(n, 2) - 1 + Sum_{k=2..A051903(n)} k * (tau(n, k+1) - tau(n, k)), where tau(n, k) is the number of k-free divisors of n (k-free numbers are numbers that are not divisible by a k-th power other than 1). For a given k >= 2, tau(n, k) is a multiplicative function with tau(p^e, k) = min(e+1, k). E.g., tau(n, 2) = A034444(n), tau(n, 3) = A073184(n), and tau(n, 4) = A252505(n).
Sum_{k=1..n} a(k) ~ c_1 * n * log(n) + c_2 * n, where c_1 is Niven's constant (A033150), c_2 = -1 + (2*gamma - 1)*c_1 - 2*zeta'(2)/zeta(2)^2 - Sum_{k>=3} (k-1) * (k*zeta'(k)/zeta(k)^2 - (k-1)*zeta'(k-1)/zeta(k-1)^2) = -2.37613633493572231366..., and gamma is Euler's constant (A001620).

A087893 Number of numbers m satisfying 1 < m < n such that m^2 == m (mod n).

Original entry on oeis.org

0, 0, 0, 0, 0, 2, 0, 0, 0, 2, 0, 2, 0, 2, 2, 0, 0, 2, 0, 2, 2, 2, 0, 2, 0, 2, 0, 2, 0, 6, 0, 0, 2, 2, 2, 2, 0, 2, 2, 2, 0, 6, 0, 2, 2, 2, 0, 2, 0, 2, 2, 2, 0, 2, 2, 2, 2, 2, 0, 6, 0, 2, 2, 0, 2, 6, 0, 2, 2, 6, 0, 2, 0, 2, 2, 2, 2, 6, 0, 2, 0, 2, 0, 6, 2, 2, 2, 2, 0, 6, 2, 2, 2, 2, 2, 2, 0, 2, 2, 2, 0, 6, 0, 2, 6

Offset: 1

Lekraj Beedassy, Oct 13 2003

nonn

The number of nontrivial unitary divisors of n (i.e., excluding 1 and n). - Amiram Eldar, May 29 2020

a(n) first deviates from b(n) = 2*A079275(n) at a(210) = 14 <> b(210) = 12. - Georg Fischer, May 23 2024

C. R. J. Singleton, "Prime Function Problem": Solution to Problem 2355, Journal of Recreational Mathematics, Vol. 29(3) pp. 232-234, 1998.

G. C. Greubel, Table of n, a(n) for n = 1..5000

Cf. A001221, A007875, A034444, A079275, A309307.

Join[{0}, Table[2^(PrimeNu[n]) - 2, {n, 2, 50}]] (* or *) Table[2*Module[{c = PrimeNu[n]}, (c (c - 1))/2], {n, 1, 20}] (* G. C. Greubel, May 20 2017 *)

concat([0], for(n=2, 50, print1( 2^(omega(n)) - 2, ", "))) \\ G. C. Greubel, May 20 2017

a(n) = 2^omega(n) - 2 (for n > 1).

A335268 Numbers that are not powers of primes (A024619) whose harmonic mean of their unitary divisors that are larger than 1 is an integer.

Original entry on oeis.org

6, 15, 20, 24, 28, 30, 45, 60, 72, 90, 91, 96, 100, 112, 153, 216, 220, 240, 264, 272, 325, 352, 360, 364, 378, 496, 703, 765, 780, 816, 832, 1056, 1125, 1170, 1225, 1360, 1431, 1512, 1656, 1760, 1891, 1900, 1984, 2275, 2448, 2520, 2701, 2912, 3024, 3168, 3321

Offset: 1

Amiram Eldar, May 29 2020

nonn

Since the unitary divisors of a power of prime (A000961), p^e, are {1, p^e}, they are trivial terms and hence they are excluded from this sequence.
The corresponding harmonic means are 3, 5, 6, 6, 7, 5, 9, 7, 12, 7, 13, 8, 10, 14, 17, ...
Equivalently, numbers m such that omega(m) > 1 and (usigma(m)-m) | m * (2^omega(m)-1), or A063919(m) | (m * A309307(m)), where usigma is the sum of unitary divisors (A034448), and 2^omega(m) = A034444(m) is the number of the unitary divisors of m.
The squarefree terms of A335267 are also terms of this sequence.
The terms with 2 distinct prime divisors are of the form p^e * (2*p^e - 1), when the second factor is also a prime power. The least term which both of its 2 prime divisors are nonunitary (with multiplicity larger than 1) is 1225 = 5^2 * 7^2 = 5^2 * (2 * 5^2 - 1).
The unitary perfect numbers (A002827) are terms of this sequence: if m is a unitary perfect number then usigma(m)-m = m.

			6 is a term since its unitary divisors other than 1 are 2, 3 and 6, and their harmonic mean, 3/(1/2 + 1/3 + 1/6) = 3, is an integer.

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

The unitary version of A335267.
A002827 is subsequence.
Cf. A006086, A000961, A024619, A034444, A034448, A063919, A077610, A309307, A335269, A335270.

usigma[1] = 1; usigma[n_] := Times @@ (1 + Power @@@ FactorInteger[n]); Select[Range[3000], (omega = PrimeNu[#]) > 1 && Divisible[# * (2^omega-1), usigma[#] - #] &]

A335270 Numbers that are not powers of primes (A024619) whose harmonic mean of their proper unitary divisors is an integer.

Original entry on oeis.org

228, 1645, 7725, 88473, 20295895122, 22550994580

Offset: 1

Amiram Eldar, May 29 2020

Since 1 is the only proper unitary divisor of powers of prime (A000961), they are trivial terms and hence they are excluded from this sequence.
The corresponding harmonic means are 4, 5, 5, 9, 18, 20.
Equivalently, numbers m such that omega(m) > 1 and (usigma(m)-1) | m*(2^omega(m)-1), where usigma is the sum of unitary divisors (A034448), and 2^omega(m) - 1 = A034444(m) - 1 = A309307(m) is the number of the proper unitary divisors of m.
The squarefree terms of A247077 are also terms of this sequence.
a(7) > 10^12, if it exists. - Giovanni Resta, May 30 2020
Conjecture: all terms are of the form n*(usigma(n)-1) where usigma(n)-1 is prime. - Chai Wah Wu, Dec 17 2020

			228 is a term since the harmonic mean of its proper unitary divisors, {1, 3, 4, 12, 19, 57, 76} is 4 which is an integer.

The unitary version of A247077.

Cf. A006086, A000961, A024619, A034444, A034448, A077610, A309307, A335268, A335269.

usigma[1] = 1; usigma[n_] := Times @@ (1 + Power @@@ FactorInteger[n]); Select[Range[10^5], (omega = PrimeNu[#]) > 1 && Divisible[# * (2^omega-1), usigma[#] - 1] &]

a(5)-a(6) from Giovanni Resta, May 30 2020

A329534 Irregular triangle read by rows: for n >= 1 row n lists the k from [1, 2, ... , n] such that A002378(k-1) = (k-1)*k == 0 (mod n).

Original entry on oeis.org

1, 1, 2, 1, 3, 1, 4, 1, 5, 1, 3, 4, 6, 1, 7, 1, 8, 1, 9, 1, 5, 6, 10, 1, 11, 1, 4, 9, 12, 1, 13, 1, 7, 8, 14, 1, 6, 10, 15, 1, 16, 1, 17, 1, 9, 10, 18, 1, 19, 1, 5, 16, 20, 1, 7, 15, 21, 1, 11, 12, 22, 1, 23, 1, 9, 16, 24, 1, 25

Offset: 1

Juri-Stepan Gerasimov, Nov 15 2019

n-th row length gives 1 for n = 1, and 2^A001221(n) for n >= 2 , that is A034444(n). [Proof: Unique lifting theorem (e.g., Apostol, 5.30 (a), p.121) for this congruence, and only two solutions 1 and p for primes p. See also the Yuval Dekel, Sep 21 2003, comment in A034444. - Wolfdieter Lang, Feb 05 2020]

			The irregular triangle T(n,k) begins
n\k  1  2  3  4 ...
1:   1
2:   1  2
3:   1  3
4:   1  4
5:   1  5
6:   1  3  4  6
7:   1  7
8:   1  8
9:   1  9
10:  1  5  6 10
11:  1 11
12:  1  4  9 12
13:  1 13
14:  1  7  8 14
15:  1  6 10 15
16:  1 16
17:  1 17
18:  1  9 10 18
19:  1 19
20:  1  5 16 20
...

Tom M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1986.

Cf. A000010, A000225, A000688, A000961, A001221, A006881, A006530, A007875, A020639, A024619, A034444, A077610, A135972, A309307.

[[k: k in [1..n] | k^2 mod n eq k]: n in [1..38]];

Table[Select[Range@ n, Mod[-n + # (# - 1), n] == 0 &], {n, 25}] // Flatten (* Michael De Vlieger, Nov 18 2019 *)

row(n) = select(x->(Mod(x, n) == Mod(x, n)^2), [1..n]); \\ Michel Marcus, Nov 19 2019

Edited by Wolfdieter Lang, Feb 05 2020

cp's OEIS Frontend

A383156 The sum of the maximum exponents in the prime factorizations of the divisors of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

Formula

A087893 Number of numbers m satisfying 1 < m < n such that m^2 == m (mod n).

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A335268 Numbers that are not powers of primes (A024619) whose harmonic mean of their unitary divisors that are larger than 1 is an integer.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A335270 Numbers that are not powers of primes (A024619) whose harmonic mean of their proper unitary divisors is an integer.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Extensions

A329534 Irregular triangle read by rows: for n >= 1 row n lists the k from [1, 2, ... , n] such that A002378(k-1) = (k-1)*k == 0 (mod n).

Views

Author

Keywords

Comments

Examples

References

Crossrefs

Programs

Magma

Mathematica

PARI

Extensions