login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A018887 Waring's problem: least number of positive n-th powers needed to sum to any sufficiently large integer. 2
1, 4, 7, 16, 18, 27, 36, 42, 55, 63, 70, 79, 87, 95, 103, 112, 120, 129, 138, 146 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

REFERENCES

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 5th ed., Oxford Univ. Press, 1979, th. 393

LINKS

Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.

CROSSREFS

A018886 for small worst cases

Sequence in context: A166669 A077582 A037373 * A059014 A166700 A160715

Adjacent sequences:  A018884 A018885 A018886 * A018888 A018889 A018890

KEYWORD

nonn,nice,hard

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 17:35 EST 2012. Contains 206061 sequences.