This paper shows how to create magic squares with a perfect square number for the total sum entries. This has been done in five ways. Initially, the two ways are using entries as consecutive odd numbers and consecutive natural numbers for odd order magic squares and consecutive fraction numbers for even order magic squares. This process sastify an interesting property known by uniformity property. The second way is also give two kind of magic squares with entries sum as perfect square. It is based on magic squares generated by Pythagorean triples. This procedure give many magic squares based on interval and order of magic squares. In this work, only the first value considered giving least possible perfect square sum of entries. In this way also there are two possibilities, one using entries as consecutive odd numbers and second using entries as consecutive natural numbers for odd order magic squares and consecutive fraction numbers for even order magic squares. In all the four possibilities given above not even a single one give us minimum perfect square sum of entries. By using the entries as nonnegative numbers, a fifth procedure is considered to get minimum perfect square sum of entries. These entries are either consecutive natural numbers for odd order magic squares and consecutive fraction numbers for even order magic squares. For each order, the work is divided in three parts resulting in five magic squares with perfect square sum of entries. Recently, author applied this idea of perfect square sum of entries to write area representations magic squares. This work is for the magic squares of orders 3 to 31. Further orders from 32 to 47 are given in another work.