|
%I #17 Dec 10 2021 11:34:41
%S 2,3,5,7,11,13,17,23,29,37,41,43,47,53,61,67,71,83,89,97,107,127,131,
%T 149,157,173,179,181,193,211,223,227,233,239,257,277,283,307,313,331,
%U 337,353,359,383,389,397,419,421,431,433,463,467,503,509,541,577
%N Ludic prime numbers.
%H Reinhard Zumkeller, <a href="/A192503/b192503.txt">Table of n, a(n) for n = 1..1000</a>
%F A010051(a(n))*A192490(a(n)) = 1.
%t a3309[nmax_] := a3309[nmax] = Module[{t = Range[2, nmax], k, r = {1}}, While[Length[t] > 0, k = First[t]; AppendTo[r, k]; t = Drop[t, {1, -1, k}]]; r];
%t ludicQ[n_, nmax_] /; 1 <= n <= nmax := MemberQ[a3309[nmax], n];
%t terms = 1000;
%t f[nmax_] := f[nmax] = Select[Range[nmax], ludicQ[#, nmax] && PrimeQ[#]&] // PadRight[#, terms]&;
%t f[nmax = terms];
%t f[nmax = 2 nmax];
%t While[f[nmax] != f[nmax/2], nmax = 2 nmax];
%t seq = f[nmax] (* _Jean-François Alcover_, Dec 10 2021, after _Ray Chandler_ in A003309 *)
%o (Haskell)
%o a192503 n = a192503_list !! (n-1)
%o a192503_list = filter ((== 1) . a010051) a003309_list
%o (PARI) A192503(maxn,bflag=0)={my(Vw=vector(maxn, x, x+1), Vl=Vec([1]), vwn=#Vw,i,vj,L=List());
%o while(vwn>0, i=Vw[1]; Vl=concat(Vl,[i]);
%o Vw=vector((vwn*(i-1))\i,x,Vw[(x*i+i-2)\(i-1)]); vwn=#Vw);
%o kill(Vw); vwn=#Vl;
%o for(j=1,vwn, vj=Vl[j]; if(isprime(vj),listput(L,vj))); kill(Vw); vwn=#L;
%o if(bflag, for(i=1,vwn, print(i," ",L[i]))); if(!bflag, return(Vec(L)));
%o } \\ _Anatoly E. Voevudko_, Feb 28 2016
%Y Intersection of A000040 and A003309.
%Y Cf. A010051, A192490.
%Y Cf. A192506 (neither ludic nor prime).
%K nonn
%O 1,1
%A _Reinhard Zumkeller_, Jul 05 2011
|
