A095306 - 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

A095306

Numbers n such that r(k) * 2^n + 1 is prime, where r() = A002275 the repunits and k is the number of decimal digits of 2^n.

1, 2, 5, 12, 19, 107, 117, 159, 217, 517, 868, 1412, 1636, 4051, 5965, 9128

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

OFFSET

1,2

COMMENTS

a(1) through a(16) have been proved to be prime with WinPFGW. a(16) has 5495 digits. No more terms up to 11700.

Results were computed using the PrimeFormGW (PFGW) primality-testing program. - Hugo Pfoertner, Nov 14 2019

LINKS

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

EXAMPLE

a(5)=19 because 111111 * 2^19 + 1 = 58254163969, a prime.

CROSSREFS

Sequence in context: A116728 A276478 A333558 * A356649 A258602 A327065

Adjacent sequences: A095303 A095304 A095305 * A095307 A095308 A095309

KEYWORD

more,nonn,base

AUTHOR

Jason Earls, Jul 13 2004

STATUS

approved