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

%I

%S 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,

%T 1,2,3,4,5,2

%N Number of pentagonal numbers needed to represent n with greedy algorithm.

%C Sequence is unbounded.

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

%K nonn

%O 1,2

%A 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 | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified November 17 18:24 EST 2019. Contains 329241 sequences. (Running on oeis4.)