|
|
|
|
|
|
|
|
|
#34 by N. J. A. Sloane at Fri Apr 21 12:52:56 EDT 2017
|
|
|
|
|
|
|
|
#33 by Ivan N. Ianakiev at Fri Apr 21 06:56:59 EDT 2017
|
|
|
|
|
|
|
|
#32 by Ivan N. Ianakiev at Fri Apr 21 06:56:50 EDT 2017
|
|
| MATHEMATICA
|
max[n_]:=Max[Length/@Split[Select[Range[n^2, (n+1)^2], CompositeQ], #2-#1==1&]];
max/@Range[2, 100] (* Ivan N. Ianakiev, Apr 21 2017 *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#31 by OEIS Server at Thu Apr 20 14:34:47 EDT 2017
|
|
| LINKS
|
Vaclav Kotesovec, <a href="/A279931/b279931_1.txt">Table of n, a(n) for n = 2..10000</a>
|
|
|
|
|
|
|
#30 by Alois P. Heinz at Thu Apr 20 14:34:47 EDT 2017
|
|
|
|
|
|
Discussion
|
| Thu Apr 20
| 14:34
| OEIS Server: Installed new b-file as b279931.txt. Old b-file is now b279931_1.txt.
|
|
|
|
|
|
|
#29 by Alois P. Heinz at Thu Apr 20 14:33:05 EDT 2017
|
|
| CROSSREFS
|
Cf. A014085 Number (number of primes between n^2 and (n+1)^2.).
|
|
|
|
|
|
|
#28 by Alois P. Heinz at Thu Apr 20 14:32:38 EDT 2017
|
|
| MAPLE
|
# second Maple program:
a:= proc(n) local i, maxsofar, scanmax;
maxsofar, scanmax:= 0, 0;
for i from n^2 to (n+1)^2 do
if isprime(i)
then scanmax:= 0
else scanmax:= scanmax+1;
maxsofar:= max(scanmax, maxsofar)
fi
od; maxsofar
end:
seq(a(n), n=2..100); # Alois P. Heinz, Apr 20 2017
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#27 by Vaclav Kotesovec at Thu Apr 20 04:41:12 EDT 2017
|
|
|
|
|
|
|
|
#26 by Vaclav Kotesovec at Thu Apr 20 04:40:51 EDT 2017
|
|
| LINKS
|
Vaclav Kotesovec, <a href="/A279931/b279931_1.txt">Table of n, a(n) for n = 2..10000</a>
|
|
|
|
|
|
|
#25 by Vaclav Kotesovec at Thu Apr 20 04:36:33 EDT 2017
|
|
| MATHEMATICA
|
Table[s=0; smax=0; Do[If[PrimeQ[j], If[s>smax, smax=s]; s=0, s++], {j, n^2, (n+1)^2}]; If[s>smax, smax=s]; smax, {n, 2, 100}] (* Vaclav Kotesovec, Apr 20 2017 *)
|
|
|
|
|
|
