The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A185187 Smallest number for which it is necessary to violate the greedy algorithm to write it as a sum of n-th powers with at most A002804 terms 0
 23, 50, 160, 466 (list; graph; refs; listen; history; text; internal format)
 OFFSET 2,1 LINKS EXAMPLE 23 qualifies for a(2) because 23 as a sum of squares with the greedy algorithm is 16+4+1+1+1 (5 terms,) but A002804(2) = 4. 50 qualifies for a(3) because 50 as a sum of cubes with the greedy algorithm is 27+8+8+1+1+1+1+1+1+1 (10 terms,) but A002804(3) = 9. CROSSREFS Sequence in context: A029493 A063321 A176660 * A157095 A281266 A165432 Adjacent sequences:  A185184 A185185 A185186 * A185188 A185189 A185190 KEYWORD nonn,more AUTHOR J. Lowell, Feb 19 2011 STATUS approved

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

Last modified October 1 04:06 EDT 2020. Contains 337441 sequences. (Running on oeis4.)