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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A018886 Waring's problem: least positive integer requiring maximum number of terms when expressed as a sum of positive n-th powers. 2
1, 7, 23, 79, 223, 703, 2175, 6399, 19455, 58367, 176127, 528383, 1589247, 4767743, 14319615, 42991615, 129105919, 387186687, 1161822207, 3486515199, 10458497023, 31377588223, 94136958975, 282427654143, 847282962431, 2541815332863 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

a(n)= (Q-1)*(2^n) +(2^n-1)*(1^n) is a sum of Q +2^n -2 terms, Q= trunc(3^n / 2^n)

REFERENCES

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

LINKS

T. D. Noe, Table of n, a(n) for n=1..200

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

P. Pollack, Analytic and Combinatorial Number Theory Course Notes, ex. 7.1.1. [?Broken link]

P. Pollack, Analytic and Combinatorial Number Theory Course Notes, ex. 7.1.1.

FORMULA

a(n) = 2^n*[(3/2)^n] - 1.

EXAMPLE

a(3)= 23= 16+ 7= 2*(2^3) + 7*(1^3) is a sum of 9 cubes

a(4)= 79= 64+15= 4*(2^4) +15*(1^4) is a sum of 19 biquadrates

CROSSREFS

Cf. A018887.

Sequence in context: A002223 A034563 A048539 * A145842 A086908 A093069

Adjacent sequences:  A018883 A018884 A018885 * A018887 A018888 A018889

KEYWORD

nonn,easy,nice

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 02:31 EST 2012. Contains 205978 sequences.