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 A179910 #19 Apr 23 2014 01:32:07
%S A179910 23,37,53,73,127,139,157,167,193,211,227,229,241,251,263,277,307,331,
%T A179910 383,389,419,433,439,443,457,467,503,521,541,557,563,577,587,599,619,
%U A179910 631,643,647,659,677,683,727,751,757,761,827,829,839,857,859,883,929
%N A179910 Primes with two embedded primes.
%C A179910 It appears that p having n embedded primes means that the set of prime integers generated by contiguous proper substrings of p has size n.
%C A179910 A079066(a(n)) = 2.
%H A179910 Reinhard Zumkeller, <a href="/A179910/b179910.txt">Table of n, a(n) for n = 1..1000</a>
%t A179910 f[n_] := Block[ {id = IntegerDigits@n}, len = Length@ id - 1; Count[ PrimeQ@ Union[ FromDigits@# & /@ Flatten[ Table[ Partition[ id, k, 1], {k, len}], 1]], True] + 1]; Select[ Prime@ Range@ 160, f@# == 3 &]
%t A179910 Select[ Prime@ Range@ 160, Function[ n, Length@ Select[ Union[ FromDigits /@ (Flatten[ Table[ Partition[#, k, 1], {k, Length@ # - 1}], 1] &)@ IntegerDigits@ n], PrimeQ]]@ # == 2 &] (* _Michael Somos_, Jan 13 2011 *)
%o A179910 (Haskell)
%o A179910 import Data.List (elemIndices)
%o A179910 a179910 n = a179910_list !! (n-1)
%o A179910 a179910_list = map (a000040 . (+ 1)) $ elemIndices 2 a079066_list
%o A179910 -- _Reinhard Zumkeller_, Jul 19 2011
%Y A179910 Cf. A039996, A079397, A033274, A034844, A092621, A179909 - A179919, A033274.
%K A179910 base,nonn
%O A179910 1,1
%A A179910 _Robert G. Wilson v_, Aug 01 2010