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 A362254 #14 May 17 2023 16:38:17
%S A362254 1,1,2,1,3,1,4,5,2,1,6,1,7,9,10,1,9,1,10,13,5,1,12,8,6,14,4,1,15,1,16,
%T A362254 21,8,25,26,1,19,25,28,1,21,1,22,29,11,1,24,16,12,19,8,1,27,18,40,32,
%U A362254 9,1,30,1,31,41,46,49,51,1,34,45,17,1,36,1,37,49
%N A362254 Reciprocal of n modulo largest prime smaller than n.
%H A362254 Alois P. Heinz, <a href="/A362254/b362254.txt">Table of n, a(n) for n = 3..10000</a>
%F A362254 a(n) = 1 <=> n in { A008864 }.
%p A362254 a:= n-> n&^(-1) mod prevprime(n):
%p A362254 seq(a(n), n=3..100);
%o A362254 (Python)
%o A362254 from sympy import prevprime
%o A362254 def A362254(n): return pow(n,-1,prevprime(n)) # _Chai Wah Wu_, Apr 13 2023
%Y A362254 Cf. A008864, A122585, A151799.
%K A362254 nonn,look
%O A362254 3,3
%A A362254 _Alois P. Heinz_, Apr 13 2023