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.

A182065 Smallest average of twin prime pairs s such that s^(2^n)+1 is prime.

This page as a plain text file.
%I A182065 #25 Sep 15 2022 06:27:19
%S A182065 4,4,4,198,30,102,3000,7332,4482,187218,150,114690,713310,1943532,
%T A182065 3467622,4470420,23045178,12529818
%N A182065 Smallest average of twin prime pairs s such that s^(2^n)+1 is prime.
%C A182065 The averages of this sequence are base values in generalized Fermat primes.
%H A182065 Yves Gallot, <a href="http://yves.gallot.pagesperso-orange.fr/primes/GFN8192done.html">Generalized Fermat Prime Search</a>.
%H A182065 OEIS Wiki, <a href="/wiki/Generalized_Fermat_numbers">Generalized Fermat numbers</a>.
%H A182065 PrimeGrid, <a href="https://www.primegrid.com/gfn_history.php">GFN Prime Search Status and History</a>.
%F A182065 a(n) = (A014574(k))^(2^n)+1, for k = 1, 1, 1, 15, 5, 9, 82, 166, 117, 2055, 12, 1366, 6162, 14522, ...
%e A182065 198^(2^4)+1 = 5580113648647376991977566450378407937 is prime.
%t A182065 t=Select[Table[Prime[n]+1,{n,10^5}],PrimeQ[#1+1]&]; s:=t[[m]]; Table[m=1; While[!PrimeQ[s^(2^n)+1],m++]; s,{n,1,9}](* Last five terms obtained by intersection with Yves Gallot records.*)
%Y A182065 Cf. A056993, A014574.
%K A182065 nonn,more
%O A182065 1,1
%A A182065 _Manuel Valdivia_, Apr 09 2012
%E A182065 a(15)-a(18) from _Jeppe Stig Nielsen_, Sep 14 2022