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”).

A139803
A033875(n) + 2^a(n) = A033875(n+1).
2
0, 1, 1, 2, 1, 2, 1, 2, 3, 4, 5, 2, 7, 4, 1, 2, 3, 4, 9, 2, 955, 468
OFFSET
1,4
COMMENTS
a(23) > 10^4. - Zak Seidov, Jan 24 2017
a(23) > 30000 (if it exists). - Pontus von Brömssen, Jan 08 2023
FORMULA
a(n) = A067760((A033875(n)-1)/2) for n >= 2. - Pontus von Brömssen, Jan 08 2023
EXAMPLE
a(10) = 4 because A033875(10) = 31, 31 + 2^4 = 47, which is prime.
MATHEMATICA
p = 2; n = 0; While[true, x = 0; While[ ! PrimeQ[p + 2^x], x++ ]; p = p + 2^x; Print[x]; n++ ]
CROSSREFS
Skipping from prime to prime by least powers of 2: A033875.
Sequence in context: A234022 A261273 A097454 * A058746 A080916 A071622
KEYWORD
nonn,more
AUTHOR
Johan Särnbratt, May 22 2008
STATUS
approved