login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A174406 a(n) = smallest number u such that almost every number is the sum of at most u n-th powers of positive numbers. 4
1, 4, 4, 15 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
A variant of Waring's problem.
"Almost all" means that the exceptions have zero density.
Only three other values of the sequence are known: a(8) = 32, a(16) = 64, and a(32) = 128. The cited survey by Vaughan and Wooley shows that G_1(8) = 32, G_1(16) = 64, and G_1(32) = 128. The quantity G_1(5) has not been evaluated, nor have G_1(6) and G_1(7). - David Covert, Jun 29 2016
LINKS
R. C. Vaughan and T. D. Wooley, Waring’s problem: a survey, Number Theory for the Millennium, III (Urbana, IL, 2000), A K Peters, Natick, MA, 2002, pp. 301-340.
CROSSREFS
Sequence in context: A326982 A263797 A331609 * A270844 A287286 A271546
KEYWORD
nonn,hard,more
AUTHOR
N. J. A. Sloane, Nov 27 2010
EXTENSIONS
a(5)-a(7) removed by David Covert, Jun 29 2016
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified March 19 07:49 EDT 2024. Contains 370958 sequences. (Running on oeis4.)