%I #20 Nov 16 2019 13:49:45
%S 2,2,1,2,1,2,2,2,1,2,2,2,1,2,2,3,2,4,5,2,3,2,2,2,1,2,5,2,4,2,2,2,1,2,
%T 2,2,1,2,2,3,7,2,6,3,2,3,2,5,4,5,2,6,2,3,8,2,4,2,2,2,1,2,5,2,6,2,3,2,
%U 2,3,2,6,6,2,3,2,4,5,2,6,3,6,6,2,3,2,2,4,4,3,2,7,3,4,5,2,2,6,8,3
%N Sequence of pairs k>0 and j>1 with the smallest j and the smallest sum j+k such that k*j^n-1 is prime.
%C When k=j=2, P is a Mersenne prime 2^(n+1)-1 with n+1 prime.
%H David Broadhurst, <a href="/A156051/a156051.txt">The first 3000 rows</a>
%H David Broadhurst, <a href="https://groups.yahoo.com/neo/groups/primeform/conversations/topics/9395">Statistics on Pierre CAMI's Riesel-hypotenuse (RH) primes</a>, Yahoo! group "primenumbers", Feb 04 2009
%H David Broadhurst, <a href="/A156051/a156051_1.txt">Statistics on Pierre CAMI's Riesel-hypotenuse (RH) primes</a>, Yahoo! group "primenumbers", Feb 04 2009 (local copy)
%H David Broadhurst, Pierre CAMI, <a href="/A156051/a156051_2.txt">Riesel-hypotenuse (RH) primes</a>, digest of 11 messages in primeform Yahoo group, Feb 4, 2009 - Oct 15, 2013. [Cached copy]
%e 2*2^1-1=3 prime so first pair =2,2 as 1*2^1-1 is unity.
%e 1*2^2-1=3 so second pair is 1,2.
%K nonn,tabf
%O 1,1
%A _Pierre CAMI_, Feb 02 2009
|