login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
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 (list; graph; refs; listen; history; text; internal format)
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
LINKS
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

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 20:08 EDT 2024. Contains 371963 sequences. (Running on oeis4.)