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

A243139
a(n) = 2^prime(n) + prime(n).
1
6, 11, 37, 135, 2059, 8205, 131089, 524307, 8388631, 536870941, 2147483679, 137438953509, 2199023255593, 8796093022251, 140737488355375, 9007199254741045, 576460752303423547, 2305843009213694013, 147573952589676412995, 2361183241434822606919
OFFSET
1,1
LINKS
J. Mestel, Archimedeans Problems Drive 1977, Eureka, 39 (1978), 38-40. (Annotated scanned copy)
MATHEMATICA
f[n_]:=(2^Prime[n] + Prime[n]); Array[f, 80, 1]
PROG
(Magma) [2^p + p: p in PrimesUpTo(80)];
CROSSREFS
Sequence in context: A108698 A002570 A038265 * A288822 A015440 A253209
KEYWORD
nonn
AUTHOR
Vincenzo Librandi, Jun 03 2014
STATUS
approved