This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A192505 #15 Dec 10 2021 11:34:49
%S A192505 19,31,59,73,79,101,103,109,113,137,139,151,163,167,191,197,199,229,
%T A192505 241,251,263,269,271,281,293,311,317,347,349,367,373,379,401,409,439,
%U A192505 443,449,457,461,479,487,491,499,521,523,547,557,563,569,571,587,599,601
%N A192505 Non-ludic numbers that are prime numbers.
%H A192505 Reinhard Zumkeller, <a href="/A192505/b192505.txt">Table of n, a(n) for n = 1..1000</a>
%F A192505 (1-A010051(a(n)))*A192490(a(n)) = 1.
%t A192505 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 A192505 ludicQ[n_, nmax_] /; 1 <= n <= nmax := MemberQ[a3309[nmax], n];
%t A192505 terms = 1000;
%t A192505 f[nmax_] := f[nmax] = Select[Range[nmax], !ludicQ[#, nmax] && PrimeQ[#]&] // PadRight[#, terms]&;
%t A192505 f[nmax = terms];
%t A192505 f[nmax = 2 nmax];
%t A192505 While[f[nmax] != f[nmax/2], nmax = 2 nmax];
%t A192505 seq = f[nmax] (* _Jean-François Alcover_, Dec 10 2021, after _Ray Chandler_ in A003309 *)
%o A192505 (Haskell)
%o A192505 a192505 n = a192505_list !! (n-1)
%o A192505 a192505_list = filter ((== 1) . a010051) a192607_list
%Y A192505 Intersection of A000040 and A192607.
%Y A192505 Cf. A010051, A192490.
%K A192505 nonn
%O A192505 1,1
%A A192505 _Reinhard Zumkeller_, Jul 05 2011