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[(n! + 8)/8, {n, 4, 30}]
A139163:=n->(ithprime(n)! + 5)/5; seq(A139163(n), n=3..15); # Wesley Ivan Hurt, Jan 23 2014
Table[(Prime[n]! + 5)/5, {n, 3, 30}]
a(n) = (prime(n)!+5)/5; \\ Michel Marcus, Jan 23 2014
f:= proc(n) local F,m,Q,E,p;
F:= ifactors(n)[2];
m:= nops(F);
Q:= map(t -> t[1],F);
E:= map(t -> t[2],F);
p:= max(Q)-1;
do
p:= nextprime(p);
if andmap(i -> add(floor(p/Q[i]^j),j=1..floor(log[Q[i]](p))) >= E[i], [$1..m]) then return p fi;
od
end proc:
f(1):= 2:
map(numtheory:-pi @ f, [$1..100]); # Robert Israel, Mar 07 2018
a = {}; Do[m = 1; While[ ! IntegerQ[Prime[m]!/n], m++ ]; AppendTo[a, m], {n, 1, 100}]; a
a(n) = forprime(p=2,, if (!(p! % n), return (primepi(p)))); \\ Michel Marcus, Mar 08 2018
f:= proc(n) local F,m,Q,E,p;
F:= ifactors(n)[2];
m:= nops(F);
Q:= map(t -> t[1],F);
E:= map(t -> t[2],F);
p:= max(Q)-1;
do
p:= nextprime(p);
if andmap(i -> add(floor(p/Q[i]^j),j=1..floor(log[Q[i]](p))) >= E[i], [$1..m]) then return p fi;
od
end proc:
f(1):= 2:
map(f, [$1..100]); # Robert Israel, Mar 07 2018
a = {}; Do[m = 1; While[ ! IntegerQ[Prime[m]!/n], m++ ]; AppendTo[a, Prime[m]], {n, 1, 100}]; a
a(n) = forprime(p=2,, if (!(p! % n), return (p))); \\ Michel Marcus, Mar 08 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
Table[(Prime[n]! + 6)/6, {n, 2, 30}]
Comments