VLATTICE - Visible Lattice Points
题意翻译
给定一个 $N \times N \times N$ 的立方体，点的编号分别从 $(0,0,0)$ 到 $(N,N,N)$。
求有多少个点从点 $(0,0,0)$ 处能看见或不被遮挡。
题目描述
Consider a N\*N\*N lattice. One corner is at (0,0,0) and the opposite one is at (N,N,N). How many lattice points are visible from corner at (0,0,0) ? A point X is visible from point Y iff no other lattice point lies on the segment joining X and Y.
Input :
The first line contains the number of test cases T. The next T lines contain an interger N
Output :
Output T lines, one corresponding to each test case.
Sample Input :
3
1
2
5
Sample Output :
7
19
175
Constraints :
T <= 50
1 <= N <= 1000000