Number of triangular numbers needed to represent n with greedy algorithm.
A057945
Number of triangular numbers needed to represent n with greedy algorithm.
Terms
- a(0) =0a(1) =1a(2) =2a(3) =1a(4) =2a(5) =3a(6) =1a(7) =2a(8) =3a(9) =2a(10) =1a(11) =2a(12) =3a(13) =2a(14) =3a(15) =1a(16) =2a(17) =3a(18) =2a(19) =3a(20) =4a(21) =1a(22) =2a(23) =3a(24) =2a(25) =3a(26) =4a(27) =2a(28) =1a(29) =2
External references
- oeis: A057945