49385

Appears in sequences

• At stage 1, start with a unit square. At each successive stage add 4*(n-1) new squares around outside with edge-to-edge contacts. Sequence gives number of squares (regardless of size) at n-th stage.at n=41A056640
• a(n) = (1/24)*(n+1)*(n+3)*(n^2+22*n+88).at n=28A090950
• Conjectured lower bound for the number of spheres of radius 1 that can be packed in a sphere of radius n.at n=39A121346
• a(n) = n*(n + 1)*(7*n + 11)/6.at n=34A255687
• Terms of A349937 that are not divisible by 3: numbers k > 1 not divisible by 2 or 3 such that A309906(k-1) < A309906(k) > A309906(k+1).at n=39A349941