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 A022462 #20 Sep 08 2022 08:44:46
%S A022462 1,1,6,3,5,9,11,22,17,19,13,33,35,23,17,47,49,43,63,61,55,59,41,65,93,
%T A022462 95,99,101,57,71,107,125,119,129,139,121,139,143,137,167,161,171,185,
%U A022462 189,175,67,175,219,221,209,227,221,191,221,227,257,259,253,273,263
%N A022462 a(n) = prime(n)*prime(n+2) mod prime(n+1).
%H A022462 G. C. Greubel, <a href="/A022462/b022462.txt">Table of n, a(n) for n = 1..10000</a>
%F A022462 a(n) = A090076(n) modulo A000040(n+1). - _Michel Marcus_, Sep 30 2013
%F A022462 Conjecture: a(n) = prime(n)*prime(n+2) - prime(n+1)*(prime(n) + prime(n+2) - prime(n+1) - 1), except for a(3) and a(8). - _Ridouane Oudra_, Oct 26 2021
%t A022462 Table[Mod[Prime[n]Prime[n+2], Prime[n+1]], {n, 1, 50}] (* _G. C. Greubel_, Feb 28 2018 *)
%o A022462 (PARI) a(n) = (prime(n)*prime(n+2)) % prime(n+1); \\ _Michel Marcus_, Sep 30 2013
%o A022462 (Magma) [NthPrime(n)*NthPrime(n+2) mod NthPrime(n+1): n in [1..50]]; // _G. C. Greubel_, Feb 28 2018
%Y A022462 Cf. A090076, A073271, A000040.
%K A022462 nonn
%O A022462 1,3
%A A022462 _Clark Kimberling_
%E A022462 Edited by _Reinhard Zumkeller_, Jul 22 2002