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.
a = {}; Do[If[PrimeQ[(n! + 10)/10], AppendTo[a, n]], {n, 1, 500}]; a
for(k=5,1e3,if(ispseudoprime(k!/10+1),print1(k", "))) \\ Charles R Greathouse IV, Jul 15 2011
a = {}; Do[m = 1; While[ ! IntegerQ[m!/n], m++ ]; AppendTo[a, (m! + n)/n], {n, 1, 50}]; a
Table[(Prime[n]! + 2)/2, {n, 1, 30}]
a(n)=prime(n)!/2 + 1 \\ Charles R Greathouse IV, Apr 29 2015
a = {}; Do[If[PrimeQ[(n! + 8)/8], AppendTo[a, n]], {n, 1, 500}]; a
is(n)=n>6 && isprime((8+n!)/8) \\ Charles R Greathouse IV, Apr 29 2016
Table[(Prime[n]! + 9)/9, {n, 4, 30}]
Prime[Range[4,12]]!/9+1 (* Harvey P. Dale, Aug 22 2020 *)
[ a: n in [1..50] | IsPrime(a) and b mod 5 eq 0 where a is b div 5 where b is Factorial(n)+5 ];
a = {}; Do[If[PrimeQ[(n! + 5)/5], AppendTo[a, (n! + 5)/5]], {n, 1, 50}]; a
Select[(5+Range[50]!)/5,PrimeQ] (* Harvey P. Dale, Dec 04 2020 *)
for(k=5,1e3,if(ispseudoprime(t=(5+k!)/5),print1(t", "))) \\ Charles R Greathouse IV, Jul 15 2011
a = {}; Do[If[PrimeQ[(-3 + n!)/3], AppendTo[a, (-3 + n!)/3]], {n, 1, 100}]; a
Select[(Range[50]!-3)/3,PrimeQ] (* Harvey P. Dale, Nov 27 2015 *)
for(n=1,1000,if(floor(n!/3-1)==n!/3-1,if(ispseudoprime(n!/3-1),print(n!/3-1)))) \\ Derek Orr, Mar 28 2014
Table[(Prime[n]! + 8)/8, {n, 3, 30}]
Table[(Prime[n]! + 10)/10, {n, 3, 30}]
a = {}; Do[If[PrimeQ[(n! + 4)/4], AppendTo[a, (n! + 4)/4]], {n, 1, 50}]; a
Select[(4+Range[100]!)/4,PrimeQ] (* Harvey P. Dale, Oct 05 2016 *)
for(k=4,1e3,if(ispseudoprime(t=k!/4+1),print1(t", "))) \\ Charles R Greathouse IV, Jul 15 2011
Comments