Shape Rule
Centered pyramid
Row 1 prints 1, row 2 prints 2 3 4, row 3 prints 5 6 7 8 9 with leading spaces.
Centered Continuous Number Pyramid in Python
Overview
What You’ll Learn
The centered continuous number pyramid prints 1, then 2 3 4, then 5 6 7 8 9 — a natural step after the mirror pattern in Program 23. This tutorial covers odd row widths, leading spaces, a running counter k, a live preview, algorithm steps, worked Python examples, edge cases, and complexity.
Outer Loop
i += 2
for i in range(1, max_n + 1, 2) sets odd row widths 1, 3, 5.
Spacing + Numbers
if j > i
Reverse loop prints spaces first, then k += 1 for each number slot.
Running Counter
k never resets
k = 1 before the outer loop; k += 1 continues across rows.
Live Preview
Odd widths 1–9
Pick a max odd width and draw the centered pyramid instantly in the browser.
O(n²)
Complexity
Each row scans max_n columns; total work scales as n².
Introduction
A centered continuous number pyramid prints numbers that keep counting across rows, with leading spaces to center each row. With max width 5, the output is 1, 2 3 4, 5 6 7 8 9 (spaces shown in the worked examples below).
In Python you use an outer loop with odd widths, a reverse inner loop with an if for spaces vs k += 1, then print() ends each row.
Why it matters?
It combines spacing logic with a persistent counter — a step up from Program 23’s three inner loops.
Key Highlights
Odd widths
i = 1, 3, 5 controls how many numbers print per row.
Leading spaces
if j > i prints spaces before numbers.
Continuous k
k += 1 never resets — numbers flow across rows.
Series Foundation
Follow Program 23; continue to Program 25 (bidirectional triangle) next.
In short: for each odd i, scan j from max_n down to 1 — print a space when j > i, else print k then k += 1, then print().
Foundation
📝 Problem & Approach
Given a positive odd max width (e.g. 5), print a centered pyramid where numbers increase continuously across rows using a counter k.
Python
# max_n = 5 (conceptual shape — dots show spaces)
# ··1·
# ·2·3·4
# 5·6·7·8·9Inputs & Outputs
| Item | Type | Description |
|---|---|---|
max_n | int | Maximum odd row width — inner loop scans j from max_n down to 1. |
i | int | Outer loop — odd row widths 1, 3, 5 via range(..., 2). |
j | int | Reverse inner loop — spaces when j > i, else print number. |
k | int | Running counter — starts at 1, increments with k += 1 across all rows. |
Minimal workflow
Pseudocode
k = 1
for i from 1 to max_n step 2:
for j from max_n down to 1:
if j > i:
print space
else:
print k; k = k + 1
print newlineApproach comparison
| Approach | Idea | Best for |
|---|---|---|
| Spacing + counter | 1, 2 3 4, 5 6 7 8 9 | Learning and interviews |
| User-input max | max_n = int(input(...)) | Flexible console programs |
| Safe input | try/except ValueError loop + even-width adjustment | Robust user-facing demos |
Cheat Sheet
⚡ Quick Reference
| Goal | Pattern |
|---|---|
| Walk rows | for i in range(1, max_n + 1, 2) |
| Init counter | k = 1 before the outer loop |
| Scan columns | for j in range(max_n, 0, -1) |
| Space or number | if j > i: print(" ", end="") else: print(k, end=" "); k += 1 |
| End the row | print() |
| User input | max_n = int(input(...)) |
Compare
📋 Fixed max_n vs User Input vs Safe Input
Same centered pyramid — different ways to control width and input validation.
Outer loop
range(..., 2)Odd row widths 1, 3, 5
Spacing
j > iLeading spaces center each row
Counter
k += 1Numbers continue across rows
Learning tip
if/elseOne inner loop handles space vs number
Context
When This Pattern Shows Up
Reach for this pattern when teaching centering with spaces, persistent counters, and if/else inside nested loops.
Post mirror exercise
Natural follow-up after Program 23 — introduces spacing logic and a running counter.
Nested-loop warm-up
Outer/inner bound practice with an immediate visual check.
Console I/O practice
Combine loops with
input()for a flexible row count.Gateway to variants
Compare Program 23 (mirror pattern) and Program 25 (bidirectional triangle) next.
Not a UI layout tool
This is a console teaching pattern — not how you build modern app screens.
Key benefit: one small program that locks in nested loops, output sequencing, and O(n²) thinking.
Interactive
🔮 Live Preview
Choose an odd max width between 1 and 9 and draw the centered continuous pyramid in the browser.
Hands-On
Examples Gallery
Three complete Python programs — fixed max width, user input, and safe input with validation. Click View Output to reveal sample console results.
📚 Getting Started
Print three rows of the centered pyramid with a running counter.
Example 1 — Fixed max_n = 5
Hard-coded width — ideal for first demos and screenshots.
Python
k = 1
for i in range(1, 6, 2):
for j in range(5, 0, -1):
if j > i:
print(" ", end="")
else:
print(k, end=" ")
k += 1
print()How It Works
When i = 1, print two spaces then 1 — output 1. When i = 3, print one space then 2 3 4. When i = 5, print 5 6 7 8 9 with no leading spaces. k never resets, so numbers continue across rows.
📈 User Input
Read the maximum odd width with input() instead of hard-coding 5.
Example 2 — User Input
Read max_n with input() and int(); adjust even widths to the nearest odd value.
Python
max_n = int(input("Enter the maximum odd width: "))
if max_n % 2 == 0:
max_n -= 1
if max_n < 1:
raise SystemExit
k = 1
for i in range(1, max_n + 1, 2):
for j in range(max_n, 0, -1):
if j > i:
print(" ", end="")
else:
print(k, end=" ")
k += 1
print()How It Works
Same spacing + counter core as Example 1; only the source of max_n changes. The even-width adjustment keeps row sizes odd for a proper pyramid shape. Non-numeric input raises ValueError from int(input()) — wrap it in try/except in safer labs.
⚡ Safe Input
Use try/except ValueError so bad input does not crash the script.
Example 3 — Safe Input with try/except Loop
Validate input before drawing the pyramid — prompt again on failure.
Python
max_n = 0
print("Enter the maximum odd width: ", end="")
while max_n < 1:
try:
max_n = int(input())
if max_n < 1:
print("Please enter a positive whole number: ", end="")
except ValueError:
print("Please enter a positive whole number: ", end="")
if max_n % 2 == 0:
max_n -= 1
k = 1
for i in range(1, max_n + 1, 2):
for j in range(max_n, 0, -1):
if j > i:
print(" ", end="")
else:
print(k, end=" ")
k += 1
print()How It Works
try/except ValueError fails on bad input — the loop re-prompts until a valid positive integer is entered, then the pyramid draws as usual.
🧠 How the Algorithm Prints Rows
1
Set up
print is built in; use input() when reading input. Set k = 1 and loop variables i, j.
Setup
2
Outer loop + odd widths
for i in range(1, max_n + 1, 2) — row widths 1, 3, 5 grow the pyramid.
Row
3
Reverse inner loop (j)
for j in range(max_n, 0, -1) scans columns from right to left.
Columns
4
Space or number
if j > i prints a space; else print(k, end=" ") and k += 1.
if/else
5
New line
print() ends the row after the inner loop.
Break
=
Centered pyramid complete
Numbers continue across rows — O(n²) time, O(1) extra memory.
Trace
🔎 Worked Walkthrough — max_n = 5
Trace each outer-loop value of i, leading spaces, numbers printed, and k after each row.
i | Leading spaces | Numbers printed | k after row | Row output |
|---|---|---|---|---|
1 | 2 (when j = 5, 4) | 1 | 2 | 1 |
3 | 1 (when j = 5) | 2, 3, 4 | 5 | 2 3 4 |
5 | 0 | 5, 6, 7, 8, 9 | 10 | 5 6 7 8 9 |
Leading spaces per row = (max - i) / 2 when max_n is odd — centers each row.
Use Cases
Where this tiny pattern (and its loop structure) shows up beyond the homework prompt.
1. Teaching Nested Loops
Clearest visual proof that outer and inner bounds interact.
Example: put print() inside the inner loop by mistake.
2. Pattern Series Base
Foundation for inverted, pyramid, diamond, and hollow variants.
Example: reset k each row and compare output.
3. Console Formatting Drills
Practice print(..., end=" ") vs row newline without complex math.
Example: put print() inside the inner loop by mistake.
4. Character Substitution
Swap digits for letters, stars, or spaced output once the loop works.
Example: print k with end=" " and padded widths for 2-digit numbers.
5. Complexity Intuition
Triangular totals make O(n²) concrete for beginners.
Example: count printed numbers for max_n = 9 → 1 + 3 + 5 + 7 + 9 = 25.
6. Input Validation Labs
Pair the pattern with try/except ValueError and positive-width checks.
Example: reject max_n <= 0 and re-prompt.
Pro Tip: when an interviewer asks for patterns, explain the outer/inner roles first — then write the loops. The story matters as much as the code.
Advantages
Why this pattern earns a permanent spot in beginner Python courses.
1. Instant Visual Feedback
Wrong bounds show up immediately as a broken staircase.
2. Minimal Concepts
Only loops and console output — no arrays or math libraries.
3. Easy to Extend
Invert, center, hollow, or change the fill character with small edits.
4. O(1) Extra Memory
Streaming output needs no storage beyond loop counters.
Pro Tip: trace the reverse inner loop on paper for max_n = 3 before coding — spacing bugs hide in the j > i condition.
Usage Tips
Small habits that keep number-pattern code clean.
1. Name Bounds Clearly
Do not reset
kinside the outer loop unless you want per-row numbering.2. Validate
input()Use
try/except ValueErrorso bad input does not crash the script.3. Keep
print()OutsideOnly call
print()after the inner loop finishes the row.4. Trace i and j on Paper
Write each
i, space count, and numbers printed before coding.5. Dry-Run One Small n
Trace
max_n = 3on paper before coding larger demos.
Pro Tip: if the output is a vertical list of single digits per line, you almost certainly put print() inside the inner loop.
Common Pitfalls
Mistakes that commonly break centered pyramid patterns.
1. Newline Inside the Inner Loop
Each digit lands on its own line — you get a column, not a triangle.
→ Use
print(" ", end="")orprint(k, end=" "); k += 1;print()only after the inner loop.2. Resetting k Each Row
Putting
k = 1inside the outer loop restarts numbering — you lose the continuous effect.→ Initialize
k = 1once before the outer loop unless you want per-row numbering.3. Forgetting Leading Spaces
Without
if j > ithe pyramid is left-aligned, not centered.→ Print a space when
j > ibefore printing numbers.4. Using Even Row Widths
Even
max_nvalues break the centering math for this version.→ Subtract 1 when
max_n % 2 == 0, or validate and prompt again.5. Unchecked input
Letters or empty input raise
ValueErrorfromint(input()).→ Wrap
int(input())intry/except ValueErrorand re-prompt on failure.
Edge Cases
Check these inputs before calling the solution done.
max_n = 1
Single row
Output is just a centered 1 with leading spaces.
max_n = 0
Empty pattern
Outer loop never runs — print nothing or show a message.
Negative
max_n < 0
Treat as invalid; re-prompt instead of silent empty output.
Even max
Even width entered
Subtract 1 to force odd width, or re-prompt for an odd value.
Bad input
Non-numeric input
int(input()) raises ValueError — validate with try/except first.
max_n = 3
Smallest pyramid
Two rows: centered 1 and 2 3.
Drill
🎯 Practice Problems
Try these variations to lock in the pattern.
1. Mirror pattern
- Three inner loops with symmetry
- Review Program 23
2. Bidirectional triangle
- Repeating digits per row
- Continue with Program 25
3. Reset k per row
- Move
k = 1inside the outer loop - Compare continuous vs per-row numbering
4. Alphabet pyramid
- Replace numbers with letters using
k += 1on chars - Same spacing logic applies
Important
Notes
- Centering. Leading spaces when
j > ishift numbers right — row width stays atmax_ncolumns. printstays on the line;print()advances — mix them carefully.- Validate
max_n > 0for interactive programs;max_n = 1prints a single centered1. - Double-digit numbers need wider spacing — consider fixed-width formatting for large pyramids.
Quick Takeaway: odd outer loop (range(..., 2)), reverse inner loop with if j > i, persistent k += 1, then print() after each row.
Analysis
⏱️ Time and Space Complexity
| Program | Time | Extra space |
|---|---|---|
| Nested loops (Examples 1–2) | O(n²) | O(1) |
| Safe input (Example 3) | O(n²) | O(1) |
🎉 Conclusion
The centered continuous number pyramid is a compact lesson in spacing and counters: print leading spaces when j > i, then k += 1 for each number slot. Master the fixed-max_n version, then try user input and safe input() validation.
Practice the three examples above, then continue to Program 25 for the bidirectional number triangle.
Never reset k inside the outer loop unless you want per-row numbering — validate max_n when reading from the console.
Pro Tips
💡 Best Practices
✅ Do
- Use
for i in range(1, max_n + 1, 2)in the outer loop - Initialize
k = 1before the outer loop - Print spaces when
j > i, else printkandk += 1 - Wrap
int(input())intry/except ValueErrorbefore usingmax_n - State O(n²) time when asked about complexity
❌ Don’t
- Call
print()inside the inner loop - Reset
kinside the outer loop (unless intentional) - Skip leading spaces — the pyramid will be left-aligned
- Use even
max_nwithout adjustment - Ignore bad console input in user-facing demos
- Skip the
max_n = 1edge case
Summary
Key Takeaways
Knowledge Unlocked
Five things to remember about this pyramid pattern
Print the pattern the beginner-friendly way.
5
Core concepts 01
Rule
Spaces + k += 1
Definition 02
Outer i+=2
Odd widths
Code 03
if j>i
Centering
Code 04
Continuous k
Never reset
Shape 05
Complexity
O(n²) time
Analysis❓ Frequently Asked Questions
The program prints leading spaces when j > i, which shifts the numbers to the right and centers the pyramid.
Because the counter k is not reset inside the outer loop. It increments with k += 1 each time a number is printed.
Row widths are odd (1, 3, 5, …) so each row adds two more numbers than the previous row.
print(" ", end="") and print(k, end=" ") stay on the same line. print() ends the current row after the inner loop finishes.
The reverse inner loop lets you print leading spaces first (when j > i) and numbers afterward — a common centering trick.
Subtract 1 to force an odd width, or validate and prompt again. This version assumes odd row sizes.
O(n²) for max width n because each row iterates across n columns.
Use a try/except ValueError around int(input()) in a loop (see Example 3) so bad input does not crash the script.
Only one row prints — a single centered 1 with leading spaces.
Did you Know? 🔊
This centered pyramid prints numbers continuously using a counter k. An if inside a reverse loop prints leading spaces when j > i, then prints k and does k += 1 once the column reaches the row boundary.
Continue to Program 25
Move on to the bidirectional number triangle in the Python number-pattern series.
About the author
12 people found this page helpful