[math-fun] To Rich: Finding primes between multiples of a fixed number
Rich -- turns out Franklin calculated a few terms of the same sequence, about a year ago, which apparently is what led to its becoming A110835 of the OEIS! (At least I can contribute a bunch more terms, in case anyone's interested.) -------------------------- Note: The log_N(k) figure (k is largest registered N-tuple before the first one that's totally composite) seems it may be converging to something around e = 2.718... which seems too weird to be true. As with your 2^N +-3 prime observation, I'll wait till I see a lot more terms, but there's some kind of gestalt definitely emerging. --Dan
Sloane accepts more terms, sometimes. I don't know what he does with things like lists of prime decades that are somewhat interesting, but go on forever. Is there an "unpublished sequences" database akin to the old UMT (unpublished math tables)? We need a review or summary of some kind, to make this work easier to find. The sequence database has an index, but I want something with more text and more pointers. It would need to be organized so that any specific collection of computed data is easy to find. Maybe some kind of multiple keyword lookup. Rich -----Original Message----- From: math-fun-bounces+rschroe=sandia.gov@mailman.xmission.com on behalf of Daniel Asimov Sent: Mon 10/9/2006 6:51 PM To: math-fun Subject: [math-fun] To Rich: Finding primes between multiples of a fixed number Rich -- turns out Franklin calculated a few terms of the same sequence, about a year ago, which apparently is what led to its becoming A110835 of the OEIS! (At least I can contribute a bunch more terms, in case anyone's interested.) -------------------------- Note: The log_N(k) figure (k is largest registered N-tuple before the first one that's totally composite) seems it may be converging to something around e = 2.718... which seems too weird to be true. As with your 2^N +-3 prime observation, I'll wait till I see a lot more terms, but there's some kind of gestalt definitely emerging. --Dan _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
On 10/9/06, Daniel Asimov <dasimov@earthlink.net> wrote:
Rich -- turns out Franklin calculated a few terms of the same sequence, about a year ago, which apparently is what led to its becoming A110835 of the OEIS!
(At least I can contribute a bunch more terms, in case anyone's interested.)
If you have a bunch more terms, you can always submit it as a b110835.txt file, the format being two columns (space separated) with values of n and A110835(n). For an example, see http://www.research.att.com/~njas/sequences/b000040.txt . That one has the first ten thousand terms -- for faster growing sequences, usually not so many terms, and for some sequences I think there may be 100,000 terms in there? I'm sure it'll be handy for whoever may be the next person to get interested in this problem to have a whole bunch of terms already computed for them. --Joshua Zucker
By all means, submit a b-file. Those hadn't been invented yet when I submitted the sequence; what's there is what fit in three lines. Franklin T. Adams-Watters -----Original Message----- From: joshua.zucker@gmail.com On 10/9/06, Daniel Asimov <dasimov@earthlink.net> wrote:
Rich -- turns out Franklin calculated a few terms of the same sequence, about a year ago, which apparently is what led to its becoming A110835 of the OEIS! (At least I can contribute a bunch more terms, in case anyone's interested.) If you have a bunch more terms, you can always submit it as a b110835.txt file, the format being two columns (space separated) with values of n and A110835(n). For an example, see http://www.research.att.com/~njas/sequences/b000040.txt . That one has the first ten thousand terms -- for faster growing sequences, usually not so many terms, and for some sequences I think there may be 100,000 terms in there? I'm sure it'll be handy for whoever may be the next person to get interested in this problem to have a whole bunch of terms already computed for them. --Joshua Zucker _______________________________________________ math-fun mailing list math-fun@mailman.xmission.com http://mailman.xmission.com/cgi-bin/mailman/listinfo/math-fun
________________________________________________________________________ Check Out the new free AIM(R) Mail -- 2 GB of storage and industry-leading spam and email virus protection.
participants (4)
-
Daniel Asimov -
franktaw＠netscape.net -
Joshua Zucker -
Schroeppel, Richard