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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A145172 Number of pentagonal numbers needed to represent n with greedy algorithm. 1
1, 2, 3, 4, 1, 2, 3, 4, 5, 2, 3, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 1, 2, 3, 4, 5, 2, 3, 4, 5, 6, 3, 4, 2, 1, 2, 3, 4, 5, 2 (list; graph; refs; listen; history; internal format)
OFFSET

1,2

COMMENTS

Sequence is unbounded.

EXAMPLE

a(21)=6 since 21=12+5+1+1+1+1

CROSSREFS

Sequence in context: A053344 A092196 A100878 * A053824 A033925 A064866

Adjacent sequences:  A145169 A145170 A145171 * A145173 A145174 A145175

KEYWORD

nonn

AUTHOR

Christina Steffan (christina.steffan(AT)gmx.at), Oct 03 2008

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 06:13 EST 2012. Contains 205991 sequences.