[go: up one dir, main page]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
Revision History for A335297 (Underlined text is an addition; strikethrough text is a deletion.)

Showing entries 1-10 | older changes
A335297 Integers k such that for all m>k, d(m)/m < d(k)/k where d(j) = Min_{p & q odd primes, 2*j = p+q, p <= q} (q-p)/2.
(history; published version)
#31 by N. J. A. Sloane at Sun Jun 28 10:34:22 EDT 2020
STATUS

editing

approved

#30 by N. J. A. Sloane at Sun Jun 28 10:34:20 EDT 2020
CROSSREFS

Cf. A002375, A066285, A335298.

STATUS

approved

editing

#29 by N. J. A. Sloane at Wed Jun 24 22:31:37 EDT 2020
STATUS

proposed

approved

#28 by Michel Marcus at Fri Jun 05 12:11:15 EDT 2020
STATUS

editing

proposed

#27 by Michel Marcus at Fri Jun 05 12:10:59 EDT 2020
PROG

upto(n) = res=List(); r=0; forstep(i=n, 1, -1, c= mindiff(2*i) / (2*i); if(c>r, r=c; listput(res, i))); Vecrev(Vec(res)) \\ using Michels mindiff \\ _)) \\ _David A. Corneth_, Jun 02 2020

STATUS

proposed

editing

#26 by Michel Marcus at Thu Jun 04 01:52:37 EDT 2020
STATUS

editing

proposed

#25 by Michel Marcus at Thu Jun 04 01:52:27 EDT 2020
NAME

Integers k such that for all m>k, d(m)/m< < d(k)/k where d(j) = Min_{p & q odd primes, 2*j = p+q, p <= q} (q-p)/2.

STATUS

proposed

editing

#24 by Michel Marcus at Tue Jun 02 04:05:28 EDT 2020
STATUS

editing

proposed

Discussion
Tue Jun 02 04:07
Michel Marcus: David, if you feel like adding code for A335298 ...
04:15
David A. Corneth: I had a brief look but I don't get that one. Can one of you adapt my code? Might be similar, it looks like an inequality sign switched somewhere. But then again I don't get it so I could be wrong.
04:36
David A. Corneth: Ya-Ping Lu, if you want to translate this to python, it works as follows. Suppose you like to search until U. Then start at i = U. Compute d(i). If it's a record so far, store i and the value of the record. Then check i = U-1. If it's a new record, store i and update the record. This all the way down to i = 1.
04:49
Ya-Ping Lu: Thanks, David. I'll give it a try. Please let me know or post the longer list of the numbers for A335298 here when you finish running the code for A335298.
#23 by Michel Marcus at Tue Jun 02 04:04:48 EDT 2020
PROG

lista(nn) = {my(v=vector(nn, k, k = 2*k; mindiff(k)/k)); for (n=1, #v-1, if (v[n] > vecmax(vector(#v-n, k, v[k+n])), print1(n, ", ")); ); } \\ Michel Marcus, Jun 01 2020

STATUS

proposed

editing

Discussion
Tue Jun 02 04:05
Michel Marcus: was really too slow
#22 by David A. Corneth at Tue Jun 02 04:00:41 EDT 2020
STATUS

editing

proposed

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified August 30 21:29 EDT 2024. Contains 375550 sequences. (Running on oeis4.)