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 A095925 #5 Aug 04 2021 11:58:08
%S A095925 3,4,3,4,3,5,3,4,3,3,4,5,3,4,3,3,3,7,4,3,5,4,3,3,5,3,4,3,5,3,4,3,3,4,
%T A095925 3,4,5,4,3,3,3,7,3,5,3,4,4,4,3,5,3,3,7,3,3,3,3,4,5,3,4,3,4,3,5,3,4,5,
%U A095925 3,5,3,3,4,5,4,3,3,5,3,5,3,8,3,5,4,3,3,5,3,4,3,3,4,3,4,3,3,3,4,7,4,3
%N A095925 Smallest m such that prime(n) mod m > 1.
%e A095925 A000040(25)=97: 97 mod 1 = 0, 97 mod 2 = 1, 97 mod 3 = 1, 97
%e A095925 mod 4 = 1, but 97 mod 5 = 2>1, therefore a(25)=5.
%t A095925 smp1[n_]:=Module[{m=2},While[Mod[n,m]<2,m++];m]; smp1/@Prime[Range[120]] (* _Harvey P. Dale_, Aug 04 2021 *)
%K A095925 nonn
%O A095925 1,1
%A A095925 _Reinhard Zumkeller_, Jul 12 2004