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