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 A172102 #10 Feb 07 2025 06:47:09 %S A172102 3,11,29,59,101,239,619,809,4253,5323,5923,6551,29131,37277,48341, %T A172102 54413,58711,60937,70537,101063,110533,214993,224603,417203,445069, %U A172102 466537,473867,511391,519089,534629,633449,686269,713771,741913,770767,1000537 %N A172102 Primes in A118482. %p A172102 isA001358 := proc(n) return ( numtheory[bigomega](n) = 2 ); end proc: %p A172102 isA109611 := proc(n) isprime(n) and ( isprime(n+2) or isA001358(n+2) ); end proc: %p A172102 A109611 := proc(n) option remember; local a; if n = 1 then 2; else a := nextprime( procname(n-1) ) ; while not isA109611(a) do a := nextprime(a) ; end do ; return a; end if; end proc: %p A172102 A118482 := proc(n) option remember ; 1+add( A109611(j),j=1..n) ; end proc: %p A172102 isA172102 := proc(n) if isprime(n) then for j from 1 do if A118482(j) > n then return false; elif A118482(j) = n then return true; end if; end do ; else false ; end if; end proc: %p A172102 for n from 1 to 10000000 do if isA172102(n) then printf("%d,\n",n) ; end if; end do ; %p A172102 # _R. J. Mathar_, Feb 07 2010 %Y A172102 Cf. A118482. %K A172102 easy,nonn %O A172102 1,1 %A A172102 _Jonathan Vos Post_, Jan 25 2010 %E A172102 Extended by _R. J. Mathar_, Feb 07 2010