Thread: A113767
View Single Post
Old 2018-04-11, 23:43   #2
science_man_88
 
science_man_88's Avatar
 
"Forget I exist"
Jul 2009
Dumbassville

26×131 Posts
Default

Quote:
Originally Posted by Citrix View Post
I am interesting in extending the series A113767
https://oeis.org/A113767

I had done some work on this in the past
http://www.mersenneforum.org/showthread.php?t=18347

1) How do I submit the two terms found 6071, 218431?
2) Is there an efficient sieve for these forms?
3) Would these sequences be finite?
1) get an OEIS account, ( or use somebody who has one) to edit the sequence.
2) modular remainders are inefficient but give that if a(n-1) is 2 mod 3, k is odd, if a(n-1) is 1 mod 3,k is even.( Oops math for the related sequence)
3) no clue.

Last fiddled with by science_man_88 on 2018-04-11 at 23:54
science_man_88 is offline   Reply With Quote