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 A258182 #5 May 23 2015 04:17:14
%S A258182 7,43,4167,857143,909091,1443299,4166667,92857143,2205882353,
%T A258182 2792792793,1046511627907,5737704918033,19083969465649,53947368421053,
%U A258182 55882352941177,772727272727273,2962962962962962963,5806451612903225807,263888888888888888889
%N A258182 Numbers which divide the concatenation of the two previous primes.
%C A258182 The terms greater than 10^18 are obtained assuming that nextprime(n) < n+(log n)^2, which is known to hold at least for 4 < n < 10^18.
%H A258182 Giovanni Resta, <a href="/A258182/b258182.txt">Table of n, a(n) for n = 1..33</a> (terms < 10^36)
%H A258182 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_786.htm">Puzzle 786</a>
%e A258182 The number 43 is in the sequence because the two previous primes are 37 and 41 and 3741 is divisible by 43.
%t A258182 Select[Range[4,10^6], Divisible[ FromDigits[ Join@@ IntegerDigits@ NextPrime[#, {-2,-1}]], #]&]
%Y A258182 Cf. A258183, A258184.
%K A258182 nonn,base
%O A258182 1,1
%A A258182 _Giovanni Resta_, May 23 2015