login
a(n) is the smallest number such that each of the first 2n primes appears exactly once in its prime factorization, either as factor or exponent.
1

%I #9 Jan 18 2020 19:32:29

%S 8,6125,3780549773,12832743794826606079,

%T 18632315678640808861660235507687953,

%U 3286237594434722554545877627252677146664874837189702511

%N a(n) is the smallest number such that each of the first 2n primes appears exactly once in its prime factorization, either as factor or exponent.

%H Harvey P. Dale, <a href="/A114133/b114133.txt">Table of n, a(n) for n = 1..18</a>

%t fp[n_]:=Module[{c=TakeDrop[Prime[Range[2n]],n],a},a=Reverse[c[[1]]];Times@@ (c[[2]]^a)]; Join[{8},Array[fp,10,2]] (* _Harvey P. Dale_, Jan 18 2020 *)

%K nonn

%O 1,1

%A _Jon Wild_, Feb 14 2006