login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A084924
Let t(x) be the highest power of 2 which divides x+1. Then a(1)=3; a(n) is the least prime p for which t(p) > t(a(n-1)).
2
3, 7, 31, 127, 1279, 3583, 5119, 6143, 8191, 81919, 131071, 524287, 14680063, 109051903, 654311423, 738197503, 2147483647, 21474836479, 51539607551, 824633720831, 13743895347199, 26388279066623, 246290604621823
OFFSET
1,1
LINKS
EXAMPLE
a(5)=1279 because t(a(4))=7 and 1279 is the least prime with t(p)>7.
PROG
(PARI) a=vector(50); a[1]=3; for(i=2, length(a), j=k=2^(factor(a[i-1]+1, 2)[1, 2]+1); while(! isprime(j-1), j+=k); a[i]=j-1); a \\ M. F. Hasler, Mar 15 2007
CROSSREFS
Sequence in context: A354536 A138864 A105768 * A001348 A006515 A093535
KEYWORD
nonn
AUTHOR
Shane Findley, Jul 15 2003
EXTENSIONS
Edited by Don Reble, May 08 2004
More terms from M. F. Hasler, Mar 15 2007
STATUS
approved