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 A022463 #17 Sep 08 2022 08:44:46
%S A022463 0,1,3,4,9,8,6,7,5,19,10,13,25,32,17,29,50,8,25,43,17,64,68,28,78,1,
%T A022463 60,15,50,104,80,39,106,28,97,57,17,150,51,5,7,78,24,149,76,153,59,
%U A022463 100,53,94,27,220,164,218,240,126,188,58,20,174,40,178,47,309,167,114,244,13
%N A022463 a(n) = prime(n^2) mod prime(n).
%H A022463 Robert Israel, <a href="/A022463/b022463.txt">Table of n, a(n) for n = 1..10000</a>
%F A022463 a(n) = A011757(n) modulo A000040(n). - _Michel Marcus_, Sep 30 2013
%p A022463 seq(ithprime(i^2) mod ithprime(i), i=1..1000); # _Robert Israel_, May 26 2014
%t A022463 Table[Mod[Prime[n^2], Prime[n]], {n, 100}] (* _Vincenzo Librandi_, Dec 09 2014 *)
%o A022463 (PARI) a(n) = prime(n^2) % prime(n); \\ _Michel Marcus_, Sep 30 2013
%o A022463 (Magma) [NthPrime(n^2) mod NthPrime(n): n in [1..90]]; // _Vincenzo Librandi_, Dec 09 2014
%K A022463 nonn
%O A022463 1,3
%A A022463 _Clark Kimberling_