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

 

Logo

Annual appeal: Please make a donation to keep the OEIS running! Over 6000 articles have referenced us, often saying "we discovered this result with the help of the OEIS".
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A003315 Representing n as sum of increasing powers.
(Formerly M0405)
0
1, 2, 3, 1, 2, 3, 4, 5, 1, 2, 3, 2, 3, 4, 5, 1, 2, 3, 4, 5, 3, 4, 5, 2, 1, 2, 3, 2, 3, 4, 2, 3, 2, 3, 4, 1, 2, 3, 4, 3, 4, 3, 2, 2, 3, 4, 3, 4, 1, 2, 3, 2, 3, 4, 5, 6, 2, 3, 3, 3, 4, 5, 2, 1, 2, 3, 4, 2, 3 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

LINKS

Table of n, a(n) for n=1..69.

T. Kløve, Representations of integers as sums of powers with increasing exponents, Nordisk Tidskr. Informationsbehandling (BIT) 12 (1972), 342-346.

CROSSREFS

Sequence in context: A276328 A276332 A274641 * A194107 A071797 A025481

Adjacent sequences:  A003312 A003313 A003314 * A003316 A003317 A003318

KEYWORD

nonn

AUTHOR

N. J. A. Sloane

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 | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy .

Last modified November 18 09:09 EST 2017. Contains 294879 sequences.