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 A071256 #21 Aug 29 2025 04:15:30
%S A071256 4,4,6,4,30,6,42,72,18,30,198,12,312,42,30,192,102,18,228,60,42,198,
%T A071256 138,72,150,312,108,420,348,30,1302,192,198,102,420,72,1998,228,312,
%U A071256 240,1230,42,1032,660,180,138,282,192,882,150,102,312,6360,108,660
%N A071256 Smallest multiple of n sandwiched between twin primes.
%C A071256 Conjecture: lim sup n ->infinity a(n)/n^2 exists = C, where 0<C<1. - _Benoit Cloitre_, May 23 2002
%H A071256 T. D. Noe, <a href="/A071256/b071256.txt">Table of n, a(n) for n=1..1000</a>
%F A071256 a(n) = n*A071558(n). - _Michel Marcus_, Aug 29 2025
%t A071256 Table[ s = 2; While[ Mod[s, n] + 2 - Boole[ PrimeQ[s - 1]] - Boole[ PrimeQ[s + 1]] > 0, s++]; s, {n, 1, 55}] (* _Jean-François Alcover_, Dec 08 2011, after Pari *)
%t A071256 With[{tpm=Mean/@Select[Partition[Prime[Range[1000]],2,1],#[[2]]-#[[1]] == 2&]},Flatten[Table[Select[tpm,Divisible[#,n]&,1],{n,60}]]] (* _Harvey P. Dale_, Apr 12 2012 *)
%o A071256 (PARI) a(n) = my(s=2); while(s%n+2-isprime(s-1)-isprime(s+1)>0, s++); s;
%Y A071256 Cf. A071558.
%K A071256 nice,nonn,changed
%O A071256 1,1
%A A071256 _Amarnath Murthy_, May 22 2002
%E A071256 More terms from _Benoit Cloitre_, May 23 2002