A165767 - OEIS

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

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

Other ways to Give

A165767

Numbers m such that 2^m-m is a semiprime.

6, 7, 15, 18, 25, 31, 33, 39, 42, 45, 49, 62, 73, 85, 93, 103, 119, 171, 187, 193, 199, 201, 269, 367, 379, 405, 413, 449, 459, 481, 489, 549, 577, 601, 631, 669, 787, 795, 1399

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,1

COMMENTS

The largest resp. smallest prime factor of 2^a(n)-a(n) is listed in A165768 resp. A165769.

a(40) >= 1489. - Max Alekseyev, Aug 05 2019

1501, 1587, 1667, 2250, 3393, 5845, 9967, 16147 are terms of this sequence. - Chai Wah Wu, Oct 18 2019

LINKS

Table of n, a(n) for n=1..39.

FORMULA

2^a(n)-a(n) = A165768(n)*A165769(n) is a semiprime.

a(n)=2k <=> 4^k/2-k is prime <=> A165768(n)=2.

EXAMPLE

199 is in this sequence because 2^199-199 = 17377902756647509 * 46235097144973199564251065756966919577339221 and these two factors are prime.

MATHEMATICA

Select[Range[1000], PrimeOmega[2^# - #]==2 &] (* Vincenzo Librandi, Dec 19 2014 *)

PROG

(PARI) for( i=1, 200, bigomega(2^i-i)==2 & print1(i", "))

CROSSREFS

Cf. A080892, A081715

Sequence in context: A084382 A315842 A085512 * A292348 A319185 A196223

Adjacent sequences: A165764 A165765 A165766 * A165768 A165769 A165770

KEYWORD

nonn,more,hard

AUTHOR

M. F. Hasler, Oct 08 2009, Oct 29 2009

EXTENSIONS

More terms from Sean A. Irvine, Oct 22 2009

a(36)-a(37) from Max Alekseyev, Jun 06 2013

a(38) from Sean A. Irvine, Mar 17 2015

a(39) from Sean A. Irvine, Jun 29 2015

STATUS

approved