mersenneforum.org OEIS sequence A088782
 Register FAQ Search Today's Posts Mark Forums Read

 2018-04-29, 19:55 #1 sweety439   Nov 2016 22·691 Posts OEIS sequence A088782 This sequence is in fact the reversed Sierpinski problem with k=10, according to the thread http://mersenneforum.org/showthread.php?t=10354&page=8, this sequence can be extended to a(184), and a(185) is > 10^6 due to the Sierpinski base 185 problem, and the related sequence A088783 can be added another term 177, since a prime 10*173^264234 is known. Also the sequence A119624 (the reversed Sierpinski problem with k=2) can be extended to a(364), and A119591 (the reversed Riesel problem with k=2) can be extended to a(580).
 2018-04-30, 06:43 #2 JeppeSN     "Jeppe" Jan 2016 Denmark A416 Posts You are absolutely right. This is about primes 10*b^t + 1 for fixed b when t runs from 1 through infinity. You call it reversed Sierpiński? I am extending A088783 as you suggested (see "History" of the entry until edits are approved). /JeppeSN
2018-04-30, 14:05   #3
sweety439

Nov 2016

22×691 Posts

Quote:
 Originally Posted by JeppeSN You are absolutely right. This is about primes 10*b^t + 1 for fixed b when t runs from 1 through infinity. You call it reversed Sierpiński? I am extending A088783 as you suggested (see "History" of the entry until edits are approved). /JeppeSN
Not just I called, please see A263500.

You can also extend A088782 to n=184, A119624 to n=364, A253178 to n=242 and A119591 to n=580 (by create a b-file).

Last fiddled with by sweety439 on 2018-04-30 at 14:05

 2018-04-30, 14:09 #4 sweety439   Nov 2016 22·691 Posts Besides, you can create a-files for these sequences for the status (with some unknown terms, you can use "?" for them and give the test limits) to n=1000.
 2018-04-30, 15:21 #5 JeppeSN     "Jeppe" Jan 2016 Denmark 22×41 Posts OK, it is a reference to Krywaruczenko, Daniel (2008) "A Reverse Sierpinski Number Problem," Rose-Hulman Undergraduate Mathematics Journal: Vol. 9 : Iss. 2 , Article 4. I will fix the link to that paper in OEIS. /JeppeSN
2018-04-30, 19:16   #6
sweety439

Nov 2016

276410 Posts

Quote:
 Originally Posted by sweety439 Besides, you can create a-files for these sequences for the status (with some unknown terms, you can use "?" for them and give the test limits) to n=1000.
Also write a reference to CRUS page.

2018-04-30, 19:17   #7
sweety439

Nov 2016

53148 Posts

Quote:
 Originally Posted by JeppeSN OK, it is a reference to Krywaruczenko, Daniel (2008) "A Reverse Sierpinski Number Problem," Rose-Hulman Undergraduate Mathematics Journal: Vol. 9 : Iss. 2 , Article 4. I will fix the link to that paper in OEIS. /JeppeSN
For A263500, I found a(n) for all n<=64 in the post http://mersenneforum.org/showpost.ph...56&postcount=2.

 2018-04-30, 22:52 #8 JeppeSN     "Jeppe" Jan 2016 Denmark 22×41 Posts Sweety439, I think you should update those OEIS entries yourself. /JeppeSN

 Similar Threads Thread Thread Starter Forum Replies Last Post MattcAnderson MattcAnderson 2 2017-04-26 22:19 carpetpool Miscellaneous Math 9 2017-03-17 22:57 T.Rex Miscellaneous Math 40 2015-09-15 14:01 T.Rex Miscellaneous Math 38 2015-09-05 16:14 T.Rex Miscellaneous Math 7 2015-08-28 18:04

All times are UTC. The time now is 08:12.

Thu Jan 21 08:12:35 UTC 2021 up 49 days, 4:23, 0 users, load averages: 2.11, 2.31, 2.31