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 A089777 #10 Aug 07 2015 02:56:59
%S A089777 13,23,37,43,53,67,73,83,97,103,113,127,137,1423,157,163,173,1811,193,
%T A089777 2011,2111,223,233,2411,257,263,277,283,293,307,313,3217,337,347,353,
%U A089777 367,373,383,397,4013,4111,4211,433,443,457,463,4723,487,4919,503,5113
%N A089777 a(n) = smallest prime of the form n followed by a prime.
%C A089777 Open problem(?): show that a(n) always exists.
%H A089777 T. D. Noe, <a href="/A089777/b089777.txt">Table of n, a(n) for n=1..10000</a>
%p A089777 cat2 := proc(a,b) local dgs ; dgs := max(1,ilog10(b)+1) ; a*10^dgs+b ; end: A089777 := proc(k) local i,p,q ; for i from 1 do p := ithprime(i) ; q := cat2(k,p) ; if isprime(q) then RETURN(q) ; fi; od: end: for k from 1 to 80 do printf("%d,",A089777(k)) ; od: # _R. J. Mathar_, Jan 05 2009
%t A089777 Table[k=2; While[p=FromDigits[Join[IntegerDigits[n],IntegerDigits[Prime[k]]]]; !PrimeQ[p], k++ ]; p, {n,100}] (* _T. D. Noe_, Jan 06 2009 *)
%Y A089777 Cf. A096915 (gives the primes that are appended to n). - _R. J. Mathar_, Jan 05 2009
%K A089777 base,easy,nonn
%O A089777 1,1
%A A089777 _Amarnath Murthy_, Nov 24 2003
%E A089777 Extended by _T. D. Noe_ and _R. J. Mathar_, Jan 06 2009