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 A167623 #14 Jan 28 2025 10:42:17
%S A167623 1,8,2,15,4,47,54,151,200,159,370,359,516,895,1166,1287,1432,2111,
%T A167623 2370,2959,3932,4407,5278,5903,6216,7375,9074,10503,627,1462,13662,
%U A167623 15607,17168,662,20674,1054,1355,1734,3541,4142,4839,8566,6545,10686,13507
%N A167623 a(n) = n^3 mod (n-th prime squared).
%H A167623 Karl-Heinz Hofmann, <a href="/A167623/b167623.txt">Table of n, a(n) for n = 1..10000</a> (first 1000 terms from G. C. Greubel)
%t A167623 (*1*) Table[PowerMod[n,3,Prime[n]^2],{n,100}]
%t A167623 (*2*) PowerMod[ #,3,Prime[ # ]^2]&/@Range[100]
%o A167623 (Python)
%o A167623 from sympy import sieve
%o A167623 def A167623(n): return pow(n, 3, sieve[n]**2) # _Karl-Heinz Hofmann_, Jan 28 2025
%o A167623 (PARI) a(n) = lift(Mod(n, prime(n)^2)^3); \\ _Michel Marcus_, Jan 28 2025
%Y A167623 Cf. A069547, A167622.
%K A167623 nonn,easy
%O A167623 1,2
%A A167623 _Zak Seidov_, Nov 07 2009