cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A066081 a(n) = smallest m such that m+2^j and m-2^j are prime for all 0 < j <= n.

This page as a plain text file.
%I A066081 #12 Aug 17 2020 01:58:31
%S A066081 5,9,15,50943795,40874929095,616517522595975,93487500801880185,
%T A066081 64606701602327559675
%N A066081 a(n) = smallest m such that m+2^j and m-2^j are prime for all 0 < j <= n.
%C A066081 Is this sequence infinite?
%H A066081 Felice Russo, <a href="http://www.primepuzzles.net/puzzles/puzz_167.htm">Prime puzzle 167</a>.
%H A066081 Marek Wolf, <a href="https://pdfs.semanticscholar.org/78a1/7349819304863ae061df88dbcb26b4908f03.pdf">Conjectures on the gaps between consecutive primes</a>
%e A066081 9-4, 9-2, 9+2, 9+4 are prime, but not 5+4 = 7+2, therefore a(2) = 9.
%Y A066081 Prime quadruples: A014561, sextets: A061671, octets: A066082.
%K A066081 hard,nonn
%O A066081 1,1
%A A066081 _Frank Ellermann_, Dec 03 2001
%E A066081 a(5) and a(6) from _Don Reble_, Dec 07 2001
%E A066081 a(7) from Jim Fougeron (Feb 07) confirmed by Phil Carmody, who also found a(8) (Feb 14 2002).