

A289760


Prime powers P for which the number of modulo P residues among sums of four sixth powers is less than P.


2



7, 8, 9, 13, 16, 27, 32, 49, 64, 81, 128, 169, 243, 256, 343, 512, 729, 961, 1024, 2048, 2187, 2197, 2401, 4096, 6561, 8192, 16384, 16807, 19683, 28561, 29791, 32768, 59049, 65536, 117649, 131072, 177147, 262144, 371293, 524288, 531441, 823543, 923521, 1048576
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,1


COMMENTS

If any prime power P = p^k (where p is prime and k >= 1) is in the sequence, then so is p^j for all j > k.
The sequence appears to consist of all numbers > 4 that are powers of 2, 3, 7, or 13, and all powers of 31 except 31 itself.
It appears that this sequence differs from the similar sequence for sums of five sixth powers only in that that sequence does not contain any powers of 31.
Conjecture: the largest prime in the sequence is 13.


LINKS

Table of n, a(n) for n=1..44.


EXAMPLE

5 is not in the sequence because (i^6 + j^6 + k^6 + m^6) mod 5, where j, k, and m are integers, can take on all 5 values 0..4.
7 is in the sequence because (i^6 + j^6 + k^6 + m^6) mod 7 can take on only 5 values (0..4), not 7.
14 is not in the sequence because  although (i^6 + j^6 + k^6 + m^6) mod 14 can take on only the 10 (not 14) values 0, 1, 2, 3, 4, 7, 8, 9, 10, and 11  14 is not a prime power.


CROSSREFS

Subsequence of A289740 (similar sequence for sums of three sixth powers).
Cf. A289631 (similar sequence for sums of two sixth powers).
Sequence in context: A296698 A297131 A289740 * A241289 A037369 A076599
Adjacent sequences: A289757 A289758 A289759 * A289761 A289762 A289763


KEYWORD

nonn,more


AUTHOR

Jon E. Schoenfield, Jul 11 2017


EXTENSIONS

a(30)a(44) added (using bfile for A289631 from Giovanni Resta) by Jon E. Schoenfield, Jul 15 2017


STATUS

approved



