The numbers 1 to n² fill the square row by row. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.
This program is part of the Number Patterns collection.
Table of contents7 sections
Consecutive Number Square output
Output (n = 4):
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

How the consecutive number square works
Each full row before row i holds n numbers. So the value at row i, column j is (i − 1) × n + j.
- Run the outer loop for
ifrom1ton, one row per pass. - Print
nnumbers (value(i − 1) × n + j). - Move to the next line.
Consecutive Number Square in C
#include <stdio.h>
int main(void) {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
printf("%3d", (i - 1) * n + j);
printf("\n");
}
return 0;
}Consecutive Number Square in C++
#include <iostream>
#include <iomanip>
using namespace std;
int main() {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
cout << setw(3) << (i - 1) * n + j;
cout << endl;
}
return 0;
}Consecutive Number Square in Java
public class ConsecutiveNumberSquare {
public static void main(String[] args) {
int n = 4;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= n; j++)
System.out.printf("%3d", (i - 1) * n + j);
System.out.println();
}
}
}Consecutive Number Square in Python
n = 4
for i in range(1, n + 1):
for j in range(1, n + 1):
print(f"{(i - 1) * n + j:3d}", end="")
print()Time and space complexity
The program prints one character for each position in the pattern, so for n rows it runs in O(n²) time. It only needs a few loop variables, so the extra memory is O(1).









