|
%I #24 Apr 27 2020 17:34:53
%S 97,641,706,722,2417,2482,2498,3026,3042,3107,3123,14657,14722,14738,
%T 15266,15282,15347,15363,17042,17058,17123,17139,17667,17683,17748,
%U 17764,28577,28642,28658,29186,29202,29267,29283,30962,30978,31043,31059,31587,31603
%N Sums of two or more distinct 4th powers of primes.
%C This is to cubes and A030078 as A192926 is to 4th powers and A030514. The subsequence of primes which are sums of two or more distinct 4th powers of primes begins 97, 641, 2417 (A193411).
%C The first term that arises in more than one way is 6539044 = 11^4 + 23^4 + 41^4 + 43^4 = 13^4 + 29^4 + 31^4 + 47^4. - _Robert Israel_, Apr 27 2020
%H Robert Israel, <a href="/A130833/b130833.txt">Table of n, a(n) for n = 1..10000</a>
%F {A030078(i) + A030078(j) for i not equal to j} UNION {A030078(i) + A030078(j) + A030078(k) for i not equal to j not equal to k} UNION {A030078(i) + A030078(j) + A030078(k) + A030078(L) for i not equal to j not equal to k not equal to L}...
%e a(1) = 97 = 2^4 + 3^4.
%e a(2) = 641 = 2^4 + 5^4.
%e a(3) = 706 = 3^4 + 5^4.
%e a(4) = 722 = 2^4 + 3^4 + 5^4.
%p N:= 40000: # for all terms <= N
%p S1:= {}:
%p S2:= {}:
%p p:= 1:
%p do
%p p:= nextprime(p);
%p if p^4 > N then break fi;
%p s:= p^4;
%p S2:= S2 union select(`<=`,map(`+`,S1 union S2, s), N);
%p S1:= S1 union {s};
%p od:
%p sort(convert(S2,list)); # _Robert Israel_, Apr 27 2020
%t nn=6; t = Sort@ Flatten@ Table[ n^4, {n, Prime@ Range@ nn}]; Select[Sort[
%t Plus @@@ Subsets[t, {2, nn}]], # < Prime[nn-1]^4 + Prime[nn]^4 &] (* _Robert G. Wilson v_, Jul 22 2011 *)
%Y Cf. A000040, A000583, A030514, A192926, A193411.
%K nonn,easy
%O 1,1
%A _Jonathan Vos Post_, Jul 21 2011
|
