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 A258184 #4 May 23 2015 04:17:33
%S A258184 1,3,7,61,167,801,1143,2001,6001,8001,125001,25000001,181818181819,
%T A258184 2500000000001,16666666666667,45000000000001,640000000000001,
%U A258184 1142857142857143,4000000000000001,37500000000000001,153846153846153847,937500000000000001,2881355932203389831
%N A258184 Numbers which divide the concatenation of the next two primes.
%C A258184 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 A258184 Giovanni Resta, <a href="/A258184/b258184.txt">Table of n, a(n) for n = 1..40</a> (terms < 10^36)
%H A258184 Carlos Rivera, <a href="http://www.primepuzzles.net/puzzles/puzz_786.htm">Puzzle 786</a>
%e A258184 The number 7 is in the sequence since the next two primes are 11 and 13 and 1113 is divisible by 7.
%t A258184 Select[Range[10^5], Divisible[ FromDigits[ Join@@ IntegerDigits@ NextPrime[#, {1, 2}]], #]&]
%Y A258184 Cf. A258182, A258183.
%K A258184 nonn,base
%O A258184 1,2
%A A258184 _Giovanni Resta_, May 23 2015