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 A167622 #13 Jan 28 2025 07:51:40
%S A167622 1,2,2,1,4,8,3,18,16,14,29,26,24,35,38,15,16,37,25,48,63,62,49,29,8,2,
%T A167622 10,17,82,106,73,18,43,106,112,148,99,104,34,163,6,59,51,71,111,25,11,
%U A167622 207,63,195,74,76,180,87,96,195,121,263,122,192,15,119,149,282,124,294
%N A167622 a(n) = n^3 mod n-th prime.
%H A167622 Karl-Heinz Hofmann, <a href="/A167622/b167622.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from G. C. Greubel)
%t A167622 (*1*) Table[PowerMod[n,3,Prime[n]],{n,100}]
%t A167622 (*2*) PowerMod[ #,3,Prime[ # ]]&/@Range[100]
%o A167622 (Python)
%o A167622 from sympy import sieve
%o A167622 def A167622(n): return pow(n,3,sieve[n]) # _Karl-Heinz Hofmann_, Jan 28 2025
%o A167622 (PARI) a(n) = lift(Mod(n, prime(n))^3); \\ _Michel Marcus_, Jan 28 2025
%Y A167622 Cf. A069547, A167623.
%K A167622 nonn
%O A167622 1,2
%A A167622 _Zak Seidov_, Nov 07 2009