Magic squares are fine, but here any single 7x7 Latin square works. An $n\times n$ Latin square is a square with the property that all the integers $1\ldots n$ appear exactly once
on each row and column. There are several ways of constructing these. When $n=7$ we have for example the following
$$
\begin{array}{ccccccc}
1&2&3&4&5&6&7\\
7&1&2&3&4&5&6\\
6&7&1&2&3&4&5\\
5&6&7&1&2&3&4\\
4&5&6&7&1&2&3\\
3&4&5&6&7&1&2\\
2&3&4&5&6&7&1\\
\end{array}
$$
Given an $n\times n$ Latin square we can construct a solution to this problem (or its generalization of partitioning the integers $\{1,2,\ldots,n^2\}$ into $n$ equal sum groups of $n$ each) as follows.
Add $n(i-1)$ to all the entries on row $\#i$. After that sum of the entries on any column equals $\sum_{i=1}^ni+ n\left(\sum_{i=1}^{n}(i-1)\right)$, which is manifestly independent of the column. Furthermore, the integer $n(i-1)+j$, $1\le i,j\le n$, can only appear on row $\#i$, and does occur there exactly once (wherevere the entry $j$ of that row of the Latin square resides). The above 7x7 Latin square gives rise to the grouping gives rise to the group
$$\{1,7+7=14,6+14=20,5+21=26,4+28=32,3+35=38,2+42=44\}$$ from the first column, $\{2,8,21,27,33,39,45\}$ from the second, $\{3,9,15,28,34,40,46\}$ from the third column,
and so forth.
It is also possible to construct magic squares from Latin squares, but then you need a little bit richer structure. You need two so called mutually ortogonal Latin squares (=MOLS).