A295658 Multiplicative with a(p^e) = p^max(0,(floor(e/2)-1)).

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

Offset

1,16

Comments

a(n) differs from A053164(n) = A000188(A000188(n)) for the first time at n=64, where a(64) = 4, while A053164(64) = 2.

Links

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

Formula

a(1) = 1; for n > 1, a(n) = A020639(n)^max(0,A004526(A067029(n))-1) * a(A028234(n)).

a(n) = A003557(A000188(n)).

Asymptotic mean: Limit_{m->oo} (1/m) * Sum_{k=1..m} a(k) = zeta(3)/zeta(6) = 1.181564... (A157289). - Amiram Eldar, Nov 30 2022

Example

For n = 64 = 2^6, a(64) = 2^(floor(6/2)-1) = 2^2 = 4.

Mathematica

f[p_, e_] := p^Max[0, Floor[e/2-1]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Nov 30 2022 *)

Prog

(Scheme, with memoization-macro definec) (definec (A295658 n) (if (= 1 n) 1 (* (expt (A020639 n) (max 0 (+ -1 (A004526 (A067029 n))))) (A295658 (A028234 n)))))
(PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, f[i, 1]^max(0, floor(f[i, 2]/2-1))); } \\ Amiram Eldar, Nov 30 2022

Crossrefs

Cf. A000188, A003557, A004526, A020639, A028234, A053164, A067029, A295657.

Cf. A046100 (positions of ones), A157289.

Sequence in context: A063775 A053164 A365333 * A307427 A318672 A359910

Adjacent sequences: A295655 A295656 A295657 * A295659 A295660 A295661

Keyword

nonn,mult

Author

Antti Karttunen, Nov 28 2017

Status

approved