|
%I #21 Aug 24 2019 12:14:57
%S 2,6,10,30,34,42,78,102,110,114,170,210,222,330,390,410,438,510,514,
%T 546,570,582,654,714,798,930,978,1010,1110,1158,1218,1230,1326,1482,
%U 1542,1554,1806,1830,1870,1938,2190,2310,2510,2530
%N a(n) is squarefree and such that for every prime p|a(n) and every prime q|p-1 then q|a(n) holds.
%C a(n) is a squarefree valid base.
%C Numbers m > 1 such that m equals A007947(A002618(m)). - _Jon Maiga_, Aug 08 2019
%H Jinyuan Wang, <a href="/A152000/b152000.txt">Table of n, a(n) for n = 1..10000</a>
%H J. Jimenez Urroz and J. Luis A.Yebra, <a href="https://cs.uwaterloo.ca/journals/JIS/VOL12/Yebra/yebra4.html">On the equation a^x=x mod b^n</a>, Journal of Integer Sequences, Vol. 12 (2009), Article 09.8.8.
%p A152000 := proc(n)
%p if n = 1 then
%p 2;
%p else
%p for a from procname(n-1)+1 do
%p if issqrfree(a) then
%p pdvs := numtheory[factorset](a) ;
%p aworks := true;
%p for p in numtheory[factorset](a) do
%p for q in numtheory[factorset](p-1) do
%p if a mod q = 0 then
%p ;
%p else
%p aworks := false;
%p end if;
%p end do:
%p end do:
%p if aworks then
%p return a;
%p end if;
%p end if;
%p end do:
%p end if;
%p end proc: # _R. J. Mathar_, Jun 01 2013
%t rad[n_] := Times @@ (First@# & /@ FactorInteger@n);
%t Select[Range[2, 2530], # == rad[#*EulerPhi[#]] &] (* _Jon Maiga_, Aug 08 2019 *)
%o (PARI) is(m) = factorback(factorint(m*eulerphi(m))[, 1]) == m && m > 1; \\ _Jinyuan Wang_, Aug 08 2019
%Y Cf. A002618, A007947, A151999.
%K easy,nonn
%O 1,1
%A J. Luis, A. Yebra and J. Jimenez Urroz, Nov 19 2008
%E Corrected and extended by _Michel Marcus_, Jun 01 2013
|
