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 A159236 #14 Jul 11 2022 19:58:25
%S A159236 11,13,17,19,37,41,53,59,61,67,71,79,89,97,107,109,113,131,151,167,
%T A159236 179,193,199,211,257,277,293,313,337,359,373,383,389,409,457,479,577,
%U A159236 599,613,617,659,661,673,691,701,709,727,739,751,757,827,829,839,863,883
%N A159236 Primes that remain prime when a 0 is inserted between every pair of adjacent digits.
%C A159236 Prime terms in A050674.
%C A159236 See A119680 for the primes obtained by inserting a 0 between each pair of adjacent digits. - _Rémy Sigrist_, Oct 08 2017
%H A159236 Harvey P. Dale, <a href="/A159236/b159236.txt">Table of n, a(n) for n = 1..1000</a>
%e A159236 409 is prime, and so is 40009 ( 4(0)0(0)9 ). Hence 409 is in the sequence.
%p A159236 Lton := proc(L) add( op(i,L)*10^(i-1),i=1..nops(L)) ; end: pad0 := proc(n) dgs := convert(n,base,10) ; L := [op(1,dgs)] ; for i from 2 to nops(dgs) do L := [op(L),0,op(i,dgs)] ; od: Lton(L) ; end: for i from 5 to 400 do p := ithprime(i) ; if isprime( pad0(p) ) then printf("%d,",p) ; fi; od: # _R. J. Mathar_, Apr 07 2009
%t A159236 Select[Prime[Range[5,200]],PrimeQ[FromDigits[Riffle[ IntegerDigits[ #],0]]]&] (* _Harvey P. Dale_, Feb 19 2015 *)
%o A159236 (Python)
%o A159236 from sympy import isprime
%o A159236 def ok(n):
%o A159236 return n > 10 and isprime(n) and isprime(int("0".join(list(str(n)))))
%o A159236 print([k for k in range(900) if ok(k)]) # _Michael S. Branicky_, Jul 11 2022
%Y A159236 Cf. A050674, A119680.
%K A159236 nonn,base
%O A159236 1,1
%A A159236 _Lekraj Beedassy_, Apr 06 2009
%E A159236 Edited by _N. J. A. Sloane_, Apr 07 2009
%E A159236 Extended by _R. J. Mathar_, Apr 07 2009