A369164 a(n) = A001221(A000688(n)).

0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 1, 0, 0, 0, 2, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 1, 0, 0, 0

Offset

1,72

Comments

First differs from A369165 at n = 36, from A080733 at n = 49, and from A107078 at n = 72.

The sums of the first 10^k terms, for k = 1, 2, ..., are 3, 40, 426, 4307, 43203, 432211, 4322486, 43226028, 432261887, 4322622387, ... . From these values the asymptotic mean of this sequence, whose existence was proven by Ivić (1983) (see the Formula section), can be empirically evaluated by 0.43226... .

References

József Sándor, Dragoslav S. Mitrinovic, Borislav Crstici, Handbook of Number Theory I, Springer Science & Business Media, 2005, Chapter V, page 164.

Links

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

Aleksandar Ivić, On the number of abelian groups of a given order and on certain related multiplicative functions, Journal of Number Theory, Vol. 16, No. 1 (1983), pp. 119-137. See p. 131, eq. 4.4.

Formula

Sum_{k=1..n} a(k) = c * n + O(sqrt(n) * log(n)^3/log(log(n))^2), where c = Sum_{k>=1} d(k) * A001221(k) is a constant, d(k) is the asymptotic density of the set {m | A000688(m) = k} (e.g., d(1) = A059956, d(2) = A271971, d(3) appears in A048109) (Ivić, 1983).

Mathematica

Table[PrimeNu[FiniteAbelianGroupCount[n]], {n, 1, 100}]

Prog

(PARI) a(n) = omega(vecprod(apply(numbpart, factor(n)[, 2])));

Crossrefs

Cf. A001221, A000688, A080733, A107078.

Cf. A048109, A059956, A271971.

Cf. A369162, A369163, A369165.

Sequence in context: A054015 A375933 A373976 * A370815 A056137 A332602

Adjacent sequences: A369161 A369162 A369163 * A369165 A369166 A369167

Keyword

nonn,easy

Author

Amiram Eldar, Jan 15 2024

Status

approved