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 A261469 #16 Sep 08 2022 08:46:13
%S A261469 1,2,3,3,8,10,12,12,14,12,12,10,12,16,14,14,12,12,12,12,16,18,18,14,
%T A261469 10,8,10,20,22,24,12,18,14,18,14,16,16,16,14,18,14,16,8,18,26,28,18,
%U A261469 10,12,12,18,18,22,18,14,14,12,12,16,26,28,20,10,20,24,30,18,16,12
%N A261469 a(n) = prime(n+3) mod prime(n).
%H A261469 Harvey P. Dale, <a href="/A261469/b261469.txt">Table of n, a(n) for n = 1..1000</a>
%F A261469 a(n) = prime(n+3) mod prime(n).
%e A261469 a(3) = 13 mod 5 = 3.
%t A261469 a[n_]:=PowerMod[Prime[n + 3], 1, Prime[n]]; Table[a[n], {n, 80}] (* _Vincenzo Librandi_, Aug 20 2015 *)
%t A261469 Mod[Last[#],First[#]]&/@Partition[Prime[Range[80]],4,1] (* _Harvey P. Dale_, Jun 23 2017 *)
%o A261469 (PARI) first(m)=vector(m,i,prime(i+3)%prime(i)) \\ _Anders Hellström_, Aug 20 2015
%o A261469 (Magma) [NthPrime(n+3) mod NthPrime(n): n in [1.. 70]]; // _Vincenzo Librandi_, Aug 20 2015
%Y A261469 Cf. A031165.
%K A261469 nonn,easy,less
%O A261469 1,2
%A A261469 _Altug Alkan_, Aug 20 2015