Smallest number of sticks of length 1 needed to construct n squares with sides of length 1.

A078633

Smallest number of sticks of length 1 needed to construct n squares with sides of length 1.

Terms

    a(0) =4a(1) =7a(2) =10a(3) =12a(4) =15a(5) =17a(6) =20a(7) =22a(8) =24a(9) =27a(10) =29a(11) =31a(12) =34a(13) =36a(14) =38a(15) =40a(16) =43a(17) =45a(18) =47a(19) =49a(20) =52a(21) =54a(22) =56a(23) =58a(24) =60a(25) =63a(26) =65a(27) =67a(28) =69a(29) =71

External references