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.

A126704 Prime numbers that are the sum of three distinct positive sixth powers.

This page as a plain text file.
%I A126704 #10 Dec 15 2015 17:06:59
%S A126704 4889,50753,51481,66377,262937,308801,797681,840241,1000793,1046657,
%T A126704 1772291,2303003,2986777,3032641,3107729,3365777,4757609,4804201,
%U A126704 5135609,7530329,7534361,8061041,8065073,10516249,12394721,14638753
%N A126704 Prime numbers that are the sum of three distinct positive sixth powers.
%H A126704 Robert Israel, <a href="/A126704/b126704.txt">Table of n, a(n) for n = 1..10000</a>
%e A126704 4889 = 2^6 + 3^6 + 4^6 = 64 + 729 + 4096.
%e A126704 66377 = 4^6 + 5^6 + 6^6 = 4096 + 15625 + 46656.
%p A126704 N:= 10^10; # to find all terms <= N
%p A126704 A := {}:
%p A126704 for a from 1 to iroot(N,6) do
%p A126704   for b from 1 to a-1 while a^6 + b^6 < N do
%p A126704     for c from (a+b) mod 2 + 1 to b-1 by 2 do
%p A126704       r:= a^6 + b^6 + c^6;
%p A126704       if r > N then break fi;
%p A126704       if isprime(r) then A:= A union {r} fi;
%p A126704 od od od:
%p A126704 sort(convert(A,list)); # _Robert Israel_, Dec 15 2015
%t A126704 Union[Select[Total/@Subsets[Range[20]^6,{3}],PrimeQ]] (* _Harvey P. Dale_, Apr 20 2013 *)
%o A126704 (PARI) {m=16; p=m^6; w=[]; for(i=1,m-2,for(j=i+1, m-1, for(k=j+1, m, if((n=i^6+j^6+k^6)<p&&isprime(n), w=concat(w,n))))); w=vecsort(w); for(h=1, #w, print1(w[h], ","))} /* _Klaus Brockhaus_, Feb 16 2007 */
%Y A126704 Cf. A125516, A126657, A126658.
%K A126704 nonn
%O A126704 1,1
%A A126704 _Tomas Xordan_, Feb 11 2007
%E A126704 Edited, corrected and extended by _Klaus Brockhaus_, Feb 16 2007