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 A263483 #11 Jul 18 2018 23:44:49
%S A263483 4,6,10,8,16,14,22,20,28,34,32,38,46,44,52,58,64,62,68,76,74,80,88,94,
%T A263483 98,106,104,112,110,118,128,136,142,140,154,152,158,164,172,178,184,
%U A263483 182,196,194,202,200,212,224,232,230,238,244,242,256,262,268,274,272,278,286,284,298,308,316,314
%N A263483 a(n) = prime(n)+(prime(n) modulo 6).
%C A263483 For n>2, a(n)-a(n+1)=2 iff prime(n) and prime(n+1) are twin primes; e.g., a(3)-a(4)=10-8=2 and prime(3)=5 and prime(4)=7 are twin primes.
%H A263483 Robert Israel, <a href="/A263483/b263483.txt">Table of n, a(n) for n = 1..10000</a>
%F A263483 a(n) = A000040(n) + A039704(n). - _Michel Marcus_, Oct 27 2015
%p A263483 p:= 1:
%p A263483 for n from 1 to 100 do
%p A263483 p:= nextprime(p);
%p A263483 A[n]:= p + (p mod 6);
%p A263483 od:
%p A263483 seq(A[n],n=1..100); # _Robert Israel_, Jul 18 2018
%t A263483 Table[(p=Prime[n])+Mod[p,6],{n,100}]
%o A263483 (PARI) a(n) = apply(x->(x + x%6), prime(n)); \\ _Michel Marcus_, Oct 27 2015
%Y A263483 Cf. A000040, A039704.
%K A263483 nonn
%O A263483 1,1
%A A263483 _Zak Seidov_, Oct 19 2015