%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