A329352 a(n) = Product_{d|n} A019565(d)^A010051(n/d).

1, 2, 2, 3, 2, 18, 2, 5, 6, 30, 2, 75, 2, 90, 60, 7, 2, 210, 2, 105, 180, 126, 2, 245, 10, 210, 14, 525, 2, 66150, 2, 11, 252, 66, 300, 1155, 2, 198, 420, 385, 2, 173250, 2, 825, 2940, 990, 2, 847, 30, 3234, 132, 1155, 2, 15246, 420, 2695, 396, 2310, 2, 2223375, 2, 6930, 1540, 13, 700, 64350, 2, 195, 1980, 171990, 2, 5005, 2, 390, 32340, 975, 1260

Offset

1,2

Links

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

Formula

a(n) = Product_{d|n} A019565(d)^A010051(n/d).

For all n, A048675(a(n)) = A069359(n).

Example

The divisors of 30 are [1, 2, 3, 5, 6, 10, 15, 30], of which only d = 6, 10 and 15 are such that 30/d is a prime, thus a(n) = A019565(6) * A019565(10) * A019565(15) = 15 * 21 * 210 = 66150.

Prog

(PARI)
A019565(n) = {my(j, v); factorback(Mat(vector(if(n, #n=vecextract(binary(n), "-1..1")), j, [prime(j), n[j]])~))}; \\ From A019565
A329352(n) = { my(m=1); fordiv(n, d, if(isprime(n/d), m *= A019565(d))); (m); };

Crossrefs

Cf. A010051, A019565, A048675, A069359, A329353 (rgs-transform).

Cf. also A329350.

Differs from A300832 for the first time at n=30, where a(30) = 66150, while A300832(30) = 132300.

Sequence in context: A110088 A322005 A064998 * A300832 A329350 A283450

Adjacent sequences: A329349 A329350 A329351 * A329353 A329354 A329355

Keyword

nonn

Author

Antti Karttunen, Nov 12 2019

Status

approved