login
a(n) = n^3 mod (n-th prime squared).
2

%I #14 Jan 28 2025 10:42:17

%S 1,8,2,15,4,47,54,151,200,159,370,359,516,895,1166,1287,1432,2111,

%T 2370,2959,3932,4407,5278,5903,6216,7375,9074,10503,627,1462,13662,

%U 15607,17168,662,20674,1054,1355,1734,3541,4142,4839,8566,6545,10686,13507

%N a(n) = n^3 mod (n-th prime squared).

%H 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 (*1*) Table[PowerMod[n,3,Prime[n]^2],{n,100}]

%t (*2*) PowerMod[ #,3,Prime[ # ]^2]&/@Range[100]

%o (Python)

%o from sympy import sieve

%o def A167623(n): return pow(n, 3, sieve[n]**2) # _Karl-Heinz Hofmann_, Jan 28 2025

%o (PARI) a(n) = lift(Mod(n, prime(n)^2)^3); \\ _Michel Marcus_, Jan 28 2025

%Y Cf. A069547, A167622.

%K nonn,easy,changed

%O 1,2

%A _Zak Seidov_, Nov 07 2009