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 A022461 #23 Jun 05 2023 13:58:25
%S A022461 1,2,2,3,1,11,12,2,2,16,29,24,12,40,25,48,16,60,24,16,60,40,1,7,24,12,
%T A022461 24,12,72,26,40,48,24,120,16,72,60,40,72,48,24,120,12,24,28,89,192,24,
%U A022461 12,40,48,24,160,72,72,48,16,60,24,24,240,252,24,12,72,280
%N A022461 a(n) = prime(n+1)*prime(n+2) mod prime(n).
%H A022461 G. C. Greubel, <a href="/A022461/b022461.txt">Table of n, a(n) for n = 1..10000</a>
%F A022461 a(n) = A006094(n+1) mod A000040(n). - _Michel Marcus_, Feb 28 2018
%t A022461 Table[Mod[Prime[n + 1]Prime[n + 2], Prime[n]], {n, 1, 80}] (* _Stefan Steinerberger_, Apr 14 2006 *)
%t A022461 Mod[#[[2]]#[[3]],#[[1]]]&/@Partition[Prime[Range[70]],3,1] (* _Harvey P. Dale_, Jun 05 2023 *)
%o A022461 (PARI) for(n=1,50, print1((prime(n+1)*prime(n+2)) % prime(n), ", ")) \\ _G. C. Greubel_, Feb 27 2018
%o A022461 (Magma) [NthPrime(n+1)*NthPrime(n+2) mod NthPrime(n): n in [1..50]]; // _G. C. Greubel_, Feb 27 2018
%Y A022461 Cf. A006094, A072565.
%K A022461 nonn
%O A022461 1,2
%A A022461 _Clark Kimberling_