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.
((Prime[Range[10]]-1)!)^2 (* Harvey P. Dale, Apr 13 2014 *)
[Factorial(NthPrime(n)-1) mod NthPrime(n)^2 : n in [1..50]]; // G. C. Greubel, Dec 17 2019
seq(`mod`(factorial(ithprime(n)-1), ithprime(n)^2), n = 1..50); # G. C. Greubel, Dec 17 2019
Table[Mod[(Prime[n]-1)!, Prime[n]^2], {n, 50}] (* G. C. Greubel, Dec 17 2019 *)
a(n) = my(p=prime(n)); (p-1)! % p^2; \\ Michel Marcus, Dec 17 2019
[mod(factorial(nth_prime(n)-1), nth_prime(n)^2) for n in (1..50)] # G. C. Greubel, Dec 17 2019
A177771 := proc(n) factorial(ithprime(n)-1) ; end proc: A178056 := proc(n) A177771(n+6)/1728000 ; end proc: seq(A178056(n),n=1..10) ; # R. J. Mathar, May 24 2010
[Factorial(p-1)mod p^3: p in PrimesUpTo(170)]; // Marius A. Burtea, Dec 18 2019
f:= proc(n) local p,p3,k,r;
p:= ithprime(n);
p3:= p^3;
r:= 1:
for k from 1 to p-1 do
r:= r*k mod p3
od;
r
end proc:
map(f, [$1..100]); # Robert Israel, Dec 18 2019
Mod[(#-1)!,#^3]&/@Prime[Range[40]] (* Harvey P. Dale, Jan 09 2024 *)
a(n) = my(p=prime(n)); (p-1)! % p^3;
q[p_] := AnyTrue[Range[p, 2*p], Divisible[(p-1)!-1, #] &]; Select[Prime[Range[300]], q] (* Amiram Eldar, Apr 22 2025 *)
forprime(n=1,1000,if(sum(k=n,2*n,if(((n-1)!-1)%k,0,1))>0,print1(n,",")))
Comments