id:A018887 - OEIS Search Results

Search: id:A018887

Displaying 1-1 of 1 results found.

page 1

Waring's problem: least number of positive n-th powers needed to sum to any sufficiently large integer.

+0
3

1, 4, 7, 16, 18, 27, 36, 42, 55, 63, 70, 79, 87, 95, 103, 112, 120, 129, 138, 146 (list; graph; listen)

	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: A065935 A077582 A037373 this_sequence A059014 A130665 A101534` `Adjacent sequences: A018884 A018885 A018886 this_sequence A018888 A018889 A018890`
	KEYWORD	`nonn,nice,hard`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified July 26 13:41 EDT 2008. Contains 142293 sequences.