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

%I #18 Jan 08 2023 14:57:06

%S 0,1,1,2,1,2,1,2,3,4,5,2,7,4,1,2,3,4,9,2,955,468

%N A033875(n) + 2^a(n) = A033875(n+1).

%C a(23) > 10^4. - _Zak Seidov_, Jan 24 2017

%C a(23) > 30000 (if it exists). - _Pontus von Brömssen_, Jan 08 2023

%F a(n) = A067760((A033875(n)-1)/2) for n >= 2. - _Pontus von Brömssen_, Jan 08 2023

%e a(10) = 4 because A033875(10) = 31, 31 + 2^4 = 47, which is prime.

%t p = 2; n = 0; While[true, x = 0; While[ ! PrimeQ[p + 2^x], x++ ]; p = p + 2^x; Print[x]; n++ ]

%Y Skipping from prime to prime by least powers of 2: A033875.

%Y Cf. A059662, A067760.

%K nonn,more

%O 1,4

%A _Johan Särnbratt_, May 22 2008

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 23 20:33 EDT 2024. Contains 371916 sequences. (Running on oeis4.)