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

A286812
a(n) = 105 - 2^n.
0
104, 103, 101, 97, 89, 73, 41, -23, -151, -407, -919, -1943, -3991, -8087, -16279, -32663, -65431, -130967, -262039, -524183, -1048471, -2097047, -4194199, -8388503, -16777111, -33554327, -67108759, -134217623, -268435351, -536870807, -1073741719, -2147483543
OFFSET
0,1
COMMENTS
Perhaps m = 105 is the largest number such that m - 2^n is prime for all 1 < n < log_2 m. Indeed 105 - 2^n is also prime for quite a few n > 6.7142455... For n = 9 we have 105 - 512 = -407 = (-1) * 11 * 37, the first instance of a composite term after a(0).
FORMULA
G.f.: (104 - 209*x)/((1 - x)*(1 - 2*x)). - Bruno Berselli, May 22 2017
MATHEMATICA
105 - 2^Range[0, 31]
PROG
(PARI) vector(40, n, n--; 105-2^n) \\ Bruno Berselli, May 22 2017
(Python) [105-2**n for n in range(40)] # Bruno Berselli, May 22 2017
(Sage) [105-2^n for n in range(40)] # Bruno Berselli, May 22 2017
(Magma) [105-2^n: n in [0..40]]; // Bruno Berselli, May 22 2017
CROSSREFS
Cf. A000079.
Sequence in context: A091025 A054904 A117845 * A328782 A163554 A045208
KEYWORD
sign,easy
AUTHOR
Alonso del Arte, May 21 2017
STATUS
approved