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.
Table[(Prime[n]! - 10)/10, {n, 3, 20}]
a(n) = prime(n)!/10 - 1 \\ David A. Corneth, Jun 02 2017
[Factorial(n)/3 -1: n in [3..25]]; // Vincenzo Librandi, Jul 20 2011
Table[(n! - 3)/3, {n, 3, 20}]
for(n=3,25, print1((n!-3)/3, ", ")) \\ G. C. Greubel, Oct 18 2018
[n: n in [5..500] | IsPrime((Factorial(n)-5) div 5)]; // Vincenzo Librandi, Nov 21 2016
a = {}; Do[If[PrimeQ[(n! - 5)/5], Print[a]; AppendTo[a, n]], {n, 1, 300}]; a (* Artur Jasinski *)
a:=proc(n) if isprime((1/6)*factorial(n)-1)=true then n else end if end proc: seq(a(n),n=4..500); # Emeric Deutsch, Apr 29 2008
a = {}; Do[If[PrimeQ[(n! - 6)/6], Print[a]; AppendTo[a, n]], {n, 1, 300}]; a (* Artur Jasinski *)
a = {}; Do[If[PrimeQ[(n! - 7)/7], Print[a]; AppendTo[a, n]], {n, 1, 300}]; a (*Artur Jasinski*)
a:=proc(n) if isprime((1/8)*factorial(n)-1)=true then n else end if end proc: seq(a(n),n=4..550); # Emeric Deutsch, May 07 2008
a = {}; Do[If[PrimeQ[(n! - 8)/8], Print[a]; AppendTo[a, n]], {n, 1, 300}]; a
a = {}; Do[If[PrimeQ[(n! - 9)/9], Print[a]; AppendTo[a, n]], {n, 1, 300}]; a
for(n=1,1000,if(floor(n!/9-1)==n!/9-1,if(ispseudoprime(n!/9-1),print(n)))) \\ Derek Orr, Mar 28 2014
a = {}; Do[k = 1; While[ ! PrimeQ[(Prime[k]! - n)/n], k++ ]; Print[a]; AppendTo[a, (Prime[k]! - n)/n], {n, 1, 100}]; a
Comments