login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

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
OFFSET
1,2
REFERENCES
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).
LINKS
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: A276332 A359264 A274641 * A194107 A071797 A338027
KEYWORD
nonn
STATUS
approved