|
Search: id:A079611
|
|
|
| A079611 |
|
Waring's problem: conjectured values for G(n), the smallest number m such that every sufficiently large number is the sum of at most m n-th powers of positive integers. |
|
+0
1
|
|
| 1, 4, 4, 16, 6, 9, 8, 32, 13, 12, 12, 16, 14, 15, 16, 64, 18, 27, 20, 25
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
The only certain values are G(1) = 1, G(2) = 4 and G(4) = 16.
|
|
REFERENCES
|
R. C. Vaughan and T. D. Wooley, Waring's problem: a survey, pp. 285-324 of Surveys in Number Theory (Urbana, May 21, 2000), ed. M. A. Bennett et al., Peters, 2003.
|
|
CROSSREFS
|
Cf. A002376, A002377, A002804
Sequence in context: A102376 A091278 A127473 this_sequence A160020 A075882 A125757
Adjacent sequences: A079608 A079609 A079610 this_sequence A079612 A079613 A079614
|
|
KEYWORD
|
nonn,hard
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), Jan 28 2003
|
|
|
Search completed in 0.002 seconds
|
