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 A111739 #6 Jan 14 2022 18:51:57
%S A111739 3,2,2,4,2,6,8,4,2,8,6,4,6,6,2,2,6,4,10,2,10,4,6,8,4,2,6,2,6,6,18,2,8,
%T A111739 4,6,4,4,10,2,2,6,10,24,10,2,6,4,6,8,4,6,20,6,2,2,6,6,4,10,6,6,2,4,2,
%U A111739 12,2,16,12,8,4,2,8,10,6,4,2,6,10,12,16,6,6,2,6,6,8,20,4,2,10,2,6,4,12,6,6,8
%N A111739 Distance between k*(n-th prime) and next prime, k=7 case.
%C A111739 Other cases: k=1 A001223 Differences between consecutive primes, k=2 A059787, k=3 A114245, k=4 A114246, k=5 A114247, k=6 A114248, k=8 A111740, k=9 A111741, k=10 A111742.
%H A111739 Harvey P. Dale, <a href="/A111739/b111739.txt">Table of n, a(n) for n = 1..1000</a>
%e A111739 a(1)=3 because prime(1)=2 and 7*2+1=17 (prime).
%t A111739 dnp[n_]:=Module[{c=7*Prime[n]},NextPrime[c]-c]; Array[dnp,100] (* _Harvey P. Dale_, Jan 14 2022 *)
%Y A111739 Cf. A001223, A059787, A114245, A114246, A114247, A114248, A111740, A111741, A111742.
%K A111739 nonn
%O A111739 1,1
%A A111739 _Zak Seidov_, Nov 18 2005