A188585 -id:A188585 - cp's OEIS frontend

A328705 Dirichlet g.f.: Product_{k>=1} zeta(k*s)^2.

1, 2, 2, 5, 2, 4, 2, 10, 5, 4, 2, 10, 2, 4, 4, 20, 2, 10, 2, 10, 4, 4, 2, 20, 5, 4, 10, 10, 2, 8, 2, 36, 4, 4, 4, 25, 2, 4, 4, 20, 2, 8, 2, 10, 10, 4, 2, 40, 5, 10, 4, 10, 2, 20, 4, 20, 4, 4, 2, 20, 2, 4, 10, 65, 4, 8, 2, 10, 4, 8, 2, 50, 2, 4, 10, 10, 4, 8, 2, 40

Offset: 1

Ilya Gutkovskiy, Oct 26 2019

Dirichlet convolution of A000688 with itself.

Vaclav Kotesovec, Table of n, a(n) for n = 1..10000

Cf. A000688, A000712, A001620, A063966, A129667, A188581, A188585, A301830.

Table[DivisorSum[n, FiniteAbelianGroupCount[n/#] FiniteAbelianGroupCount[#] &], {n, 1, 80}]

a(n) = Sum_{d|n} A000688(n/d) * A000688(d).
Sum_{k=1..n} a(k) ~ c^2 * n * (log(n) + 2*gamma - 1 - 2*s), where c = A021002 = Product_{k>=2} zeta(k) = 2.2948565916733137941835158313443112887131637994..., s = Sum_{k>=2} k*zeta'(k)/zeta(k) = -2.1955691982567064617939038695473479681910375... and gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, Oct 26 2019
Multiplicative with a(p^e) = A000712(e). - Amiram Eldar, Nov 30 2020

A385418 The number of unordered factorizations of n into powers of primes of the form p^(2^k-1) where p is prime and k >= 0.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1

Offset: 1

Amiram Eldar, Jun 28 2025

First differs from A304327 and A368248 at n = 64.
First differs from A061704 and A362852 at n = 128.
The number of unordered factorizations of n into powers of primes in A036537.

			  n | a(n) | factorizations
  --+------+-------------------------------------------------------------------
  2 |    8 | 2 * 2 * 2, 2^3
  3 |   64 | 2 * 2 * 2 * 2 * 2 * 2, 2 * 2 * 2 * 2^3, 2^3 * 2^3
  4 |  128 | 2 * 2 * 2 * 2 * 2 * 2 * 2, 2 * 2 * 2 * 2 * 2^3, 2 * 2^3 * 2^3, 2^7

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

Cf. A000929, A036537.
Cf. A061704, A304327, A362852, A368248.
Similar sequences: A000688, A046951, A050361, A050377, A188581, A188585, A322885, A370256, A384912, A384913, A384914, A384915, A384916.

T[n_, k_] := T[n, k] = If[k <= n, T[n - k, k] + T[n, 2*k + 1], Boole[n == 0]]; f[p_, e_] := T[e, 1];
a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100]

t(n, k) = if(k <= n, t(n-k, k) + t(n, 2*k+1), n == 0);
a(n) = vecprod(apply(x -> t(x, 1), factor(n)[,2]));

Multiplicative with a(p^e) = A000929(e).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = Product_{k>=2} zeta(2^k-1) = 1.21213028603089660618... .

cp's OEIS Frontend

A328705 Dirichlet g.f.: Product_{k>=1} zeta(k*s)^2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

Formula