cp's OEIS Frontend

A066676 Smallest number m such that phi(m) is a multiple of n-th primorial number, the product of first n primes.

%I A066676 #21 Jul 08 2018 01:49:45
%S A066676 3,7,31,211,2311,60653,1023053,19417793,446235509,12939711677,
%T A066676 200560490131,14841484883609,608500576478849,26165522997357677,
%U A066676 1229779567395958169,65178316970529225209,3845520700432469775917,234576762719782814756597,15716643102168462956621849
%N A066676 Smallest number m such that phi(m) is a multiple of n-th primorial number, the product of first n primes.
%H A066676 Ray Chandler, <a href="/A066676/b066676.txt">Table of n, a(n) for n = 1..25</a>
%F A066676 a(n) = Min{x : A000010(x) mod A002110(n) = 0}.
%e A066676 n = 8: a(8) = 19417793, phi(a(8)) = 19199380 = 2*9699690 = 2*2*3*5*7*11*13*17*19.
%t A066676 nmax = 25;
%t A066676 A066676 = {};
%t A066676 pm = 1;
%t A066676 Do[
%t A066676   pm *= Prime[n];
%t A066676   sol = 0;
%t A066676   If[PrimeQ[pm + 1],
%t A066676    sol = pm + 1;
%t A066676    ,
%t A066676    sd = Select[Divisors[pm/2], # <= Sqrt[pm/2] &];
%t A066676    Do[
%t A066676     f1 = sd[[i]];
%t A066676     f2 = pm/2/f1;
%t A066676     If[PrimeQ[2 f1 + 1] && PrimeQ[2 f2 + 1],
%t A066676      sol = (2 f1 + 1)*(2 f2 + 1);
%t A066676      Break[];
%t A066676      ];
%t A066676      , {i, Length[sd], 1, -1}];
%t A066676    ];
%t A066676   AppendTo[A066676, sol];
%t A066676   Print[{n, sol}];
%t A066676    , {n, nmax}];
%t A066676 A066676 (* _Ray Chandler_, Oct 21 2011 *)
%Y A066676 Cf. A000010, A002110, A066674, A066675, A066677, A066678.
%K A066676 nonn
%O A066676 1,1
%A A066676 _Labos Elemer_, Dec 19 2001
%E A066676 a(9)-a(11) from _Donovan Johnson_, Oct 12 2011
%E A066676 a(12)-a(13) upper limits from _Donovan Johnson_ confirmed as next terms, a(14)-a(19) added by _Ray Chandler_, Oct 21 2011