A331599 a(n) = A241909(n) / gcd(A122111(n),A241909(n)).

1, 1, 1, 1, 1, 3, 1, 1, 2, 9, 1, 5, 1, 27, 1, 1, 1, 1, 1, 25, 3, 81, 1, 7, 4, 243, 2, 125, 1, 5, 1, 1, 9, 729, 2, 5, 1, 2187, 27, 49, 1, 25, 1, 625, 1, 6561, 1, 11, 8, 1, 81, 3125, 1, 3, 1, 343, 243, 19683, 1, 35, 1, 59049, 5, 1, 3, 125, 1, 15625, 729, 5, 1, 7, 1, 177147, 2, 78125, 4, 625, 1, 121, 2, 531441, 1, 245, 9, 1594323, 2187, 2401, 1, 21

Offset

1,6

Comments

It appears that these and the terms of A331598 have the same prime signatures, that is, A046523(a(n)) = A046523(A331598(n)) seems to hold for all n.

Links

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

Index entries for sequences computed from indices in prime factorization

Formula

a(n) = A241909(n) / A331595(n) = A241909(n) / gcd(A122111(n),A241909(n)).

a(n) = A331598(A241916(n)).

Mathematica

Array[If[# == 1, 1, #2/GCD[#1, #2] & @@ {Block[{k = #, m = 0}, Times @@ Power @@@ Table[k -= m; k = DeleteCases[k, 0]; {Prime@ Length@ k, m = Min@ k}, Length@ Union@ k]] &@ Catenate[ConstantArray[PrimePi[#1], #2] & @@@ #], Function[t, Times @@ Prime@ Accumulate[If[Length@ t < 2, {0}, Join[{1}, ConstantArray[0, Length@ t - 2], {-1}]] + ReplacePart[t, Map[#1 -> #2 & @@ # &, #]]]]@ ConstantArray[0, Transpose[#][[1, -1]]] &[# /. {p_, e_} /; p > 0 :> {PrimePi@ p, e}]} &@ FactorInteger[#]] &, 90] (* Michael De Vlieger, Jan 24 2020, after JungHwan Min at A122111 *)

Prog

(PARI) A331599(n) = { my(u=A241909(n)); u/gcd(A122111(n), u); };

Crossrefs

Cf. A122111, A241909, A241916, A331595, A331598.

Sequence in context: A204165 A329473 A200702 * A328901 A362019 A016564

Adjacent sequences: A331596 A331597 A331598 * A331600 A331601 A331602

Keyword

nonn

Author

Antti Karttunen, Jan 22 2020

Status

approved