|
|
|
|
|
|
|
|
|
#35 by OEIS Server at Tue Apr 16 16:05:47 EDT 2024
|
|
| LINKS
|
David A. Corneth, <a href="/A064370/b064370_2.txt">Table of n, a(n) for n = 1..7110</a> (first 300 terms from Harry J. Smith, terms 301..1000 from Zak Seidov)
|
|
|
|
|
|
|
#34 by Alois P. Heinz at Tue Apr 16 16:05:47 EDT 2024
|
|
|
|
|
|
Discussion
|
| Tue Apr 16
| 16:05
| OEIS Server: Installed new b-file as b064370.txt. Old b-file is now b064370_2.txt.
|
|
|
|
|
|
|
#33 by David A. Corneth at Tue Apr 16 15:48:42 EDT 2024
|
|
|
|
|
|
Discussion
|
| Tue Apr 16
| 15:49
| David A. Corneth: The other programs make a call to prime, which seems expensive.
|
|
|
|
|
|
|
#32 by David A. Corneth at Tue Apr 16 15:47:20 EDT 2024
|
|
| LINKS
|
ZakDavid SeidovA. Corneth, <a href="/A064370/b064370_2.txt">Table of n, a(n) for n = 1..10007110</a> (first 300 terms from Harry J. Smith, terms 301..1000 from Zak Seidov)
|
|
|
|
|
Discussion
|
| Tue Apr 16
| 15:48
| David A. Corneth: In hindsight I should have maybe done a first prog but I went for upto. Should be fine anyway.
|
|
|
|
|
|
|
#31 by David A. Corneth at Tue Apr 16 15:33:04 EDT 2024
|
|
| PROG
|
(PARI)
upto(n) = {
my(t = 0, res = List(0));
forprime(p = 2, oo,
t++;
if(t > n, return(res));
if(issquare(p-t),
listput(res, t)
);
);
} \\ David A. Corneth, Apr 16 2024
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#30 by Paolo Xausa at Tue Apr 16 15:26:00 EDT 2024
|
|
|
|
|
|
|
|
#29 by Paolo Xausa at Tue Apr 16 15:25:32 EDT 2024
|
|
| MATHEMATICA
|
Join[{0}, Select[Range[50000], IntegerQ[Sqrt[Prime[#] - #]] &]] (* Paolo Xausa, Apr 16 2024 *)
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
|
#28 by Michael De Vlieger at Sat Apr 13 15:05:44 EDT 2024
|
|
|
|
|
|
|
|
#27 by Michael De Vlieger at Sat Apr 13 15:05:39 EDT 2024
|
|
| KEYWORD
|
easy,nonn,changed
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#26 by Jon E. Schoenfield at Sat Apr 13 13:51:22 EDT 2024
|
|
|
|
|
|
Discussion
|
| Sat Apr 13
| 15:05
| Michael De Vlieger: Since "easy" isn't a "necessary" keyword, it should be removed. An easy sequence is one for which we can generate "many" terms, which could be taken to be a "full standard" bfile of 10,000 terms. It could be argued that an easy sequence could quickly yield a million terms in under a minute, etc. Therefore in the vein of recent edits, I think it should be removed.
|
|
|
|
|
|
