|
%I #33 Jan 04 2024 15:30:50
%S 2,5,13,29,97,139,353,4889,72353,353815699,42065402653,84998999651,
%T 102769130749,15622297824266188673,28101527071305611527,
%U 20896779938941631284493075599148668795944697935466419104293,105312291668560568089831550410013687058921146068446092937783402353
%N Primes of the form j^k + (j-1)^k + ... + 2^k, for j > 1 and k > 0.
%C Except for the terms 2, 5, 13, 29, 139, the exponent k satisfies k >= 4. More generally, if Q(j) = j^k + (j-1)^k + ... + 2^k is a term, then j-1 is a divisor of A064538(k). This is because (j-1) is a factor of Q(j) and thus Q(j) is prime only if j-1 is a divisor of the denominator of Q(j), i.e. A064538(k). Thus for each k there is only a finite number of values of j to check. This provides an efficient algorithm to find terms of this sequence by looking only for primes in the numbers H_{j,-k) - 1 = j^k + (j-1)^k + ... + 2^k for j-1 a divisor of A064538(k). - _Chai Wah Wu_, Mar 06 2018
%H Chai Wah Wu, <a href="/A299145/b299145.txt">Table of n, a(n) for n = 1..45</a> (all terms < 10^1000).
%e 2 = 2^1;
%e 5 = 3^1 + 2^1;
%e 13 = 3^2 + 2^2;
%e 29 = 4^2 + 3^2 + 2^2;
%e 97 = 3^4 + 2^4;
%e 139 = 7^2 + 6^2 + 5^2 + 4^2 + 3^2 + 2^2;
%e 353 = 4^4 + 3^4 + 2^4;
%e 4889 = 4^6 + 3^6 + 2^6;
%e 72353 = 4^8 + 3^8 + 2^8;
%t With[{nn = 350}, Sort@ Flatten@ Map[Select[#, PrimeQ] &, Table[Total[Range[j, 1, -1]^k] - 1, {j, 2, nn}, {k, nn - j}]]] (* _Michael De Vlieger_, Feb 03 2018 *)
%o (PARI) limit=100000; v=vector(limit); for(n=1, ceil((-1+(1+8*limit)^(1/2))/2), for(k=1, logint(limit, n+0^(n-1)), a=sum(i=1,n,i^k)-1;if(isprime(a)&&a<limit+1, v[a]=1, ))); for(a=1, limit, if(v[a], print1(a", ")))
%Y Cf. A007689, A074526, A064538.
%K nonn
%O 1,1
%A _Gionata Neri_, Feb 03 2018
%E a(10)-a(15) from _Michael De Vlieger_, Feb 03 2018
%E a(16)-a(17) from _Chai Wah Wu_, Mar 07 2018
|
