Odd-Length Descending Number Triangle Pattern in Python

Beginner

⏱️ 8 min read

📚 Updated: Aug 2026

🎯 3 Code Examples

🚀 Live Preview

Step Size Loop

Odd-length descending number triangle output (1234567, 12345, 123, 1) in Python programming

Overview

What You’ll Learn

The odd-length descending number triangle teaches how a custom outer-loop step (range(..., -2)) skips even row widths. This tutorial covers the shape rule, loop structure, a live preview, algorithm steps, worked Python examples, edge cases, and complexity.

Shape Rule

only odd row widths

Row lengths are 7, 5, 3, 1 — each row prints 1 through i with no even-width lines.

Outer Loop

Rows

for i in range(max_n, 0, -2): visits only odd row lengths from the top down.

Inner Loop

1..i ascending

for j in range(1, i + 1): prints digits 1 through i on every row.

print end= vs print()

Same line / next line

Digits use print(j, end=""); end each row with print().

Live Preview

1–20 max

Pick an odd maximum and draw the odd-length descending triangle instantly in the browser.

O(n²)

Complexity

Total digit prints still = n(n+1)/2; extra memory stays O(1).

Introduction

An odd-length descending number triangle prints ascending digits on each row, but only for odd row widths. With max_n = 7, the output is 1234567, 12345, 123, 1.

In Python you solve it with a descending outer loop that steps by 2: for i in range(max_n, 0, -2):, an inner loop for j in range(1, i + 1): that prints each digit, then print() ends each row.

Why it matters?

It shows how changing the loop step creates entirely new shapes — not just different bounds.

Key Highlights

Step by 2

range(..., -2) skips even row widths.

Always Ascending

Inner loop always prints 1..i on every row.

Print Then Break

print(j, end="") in the inner loop; print() after.

Series Foundation

Follow Program 13; continue to Program 15 (binary triangle).

In short: for each odd row length i from max_n down to 1 stepping by 2, print 1..i with print(j, end=""), then call print().

Foundation

📝 Problem & Approach

Given a positive odd integer max_n (or adjusted to odd), print an odd-length descending number triangle: row length i prints digits 1 through i, with the outer loop using range(max_n, 0, -2).

Python

# max_n = 7 (conceptual shape)
# 1234567
# 12345
# 123
# 1
for i in range(max_n, 0, -2):
    for j in range(1, i + 1):
        print(j, end="")   # digits 1..i
    print()                # next row

Inputs & Outputs

Item	Type	Description
`max_n`	int	Maximum (odd) row width — first row prints `1..max_n`.
Printed output	text	Only odd-length rows; each prints ascending digits `1..i`.

Minimal workflow

Pseudocode

for i from max_n down to 1 step -2:
    for j from 1 to i:
        print j (no newline)
    print newline

Approach comparison

Approach	Idea	Best for
`range(..., -2)` outer loop	Skip even row widths	Learning and interviews
`range(..., -1)` outer loop	Print every width (7, 6, 5, …, 1)	Full descending triangle comparison

Cheat Sheet

⚡ Quick Reference

Goal	Pattern
Walk odd row lengths	`for i in range(max_n, 0, -2):`
Print `1..i`	`for j in range(1, i + 1): print(j, end="")`
End the row	`print()`
Force odd max	`if max_n % 2 == 0: max_n -= 1`
All widths variant	`for i in range(max_n, 0, -1):` (step by 1)
Program 13 variant	`if i % 2 == 0` descending else ascending (zigzag)

Compare

📋 Step by 2 vs Step by 1 vs Inner Loop

Same family of triangles — different outer-loop steps.

range(..., -2)

odd only

Prints 7, 5, 3, 1 — skips even widths

range(..., -1)

all widths

Prints 7, 6, 5, 4, 3, 2, 1 — every row

Inner 1..i

ascending

Always prints digits 1 through i on each row

Learning tip

step first

Master step -2 before comparing with step -1

Context

When This Pattern Shows Up

Reach for this pattern when teaching custom loop steps and skipped iterations.

First lab exercise
Most Python pattern series start here before pyramids and diamonds.
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 13 (zigzag) and Program 15 (binary 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

Enter an odd maximum between 1 and 20 and draw the odd-length descending triangle in the browser.

Hands-On

Examples Gallery

Three complete Python programs — fixed maximum, configurable input(), and a step-by-1 comparison. Click View Output to reveal sample console results.

📚 Getting Started

Print four odd-length rows starting from max_n = 7 with a step of -2.

Example 1 — Fixed `max_n = 7`

Hard-coded height — ideal for first demos and screenshots.

Python

for i in range(7, 0, -2):
    for j in range(1, i + 1):
        print(j, end="")
    print()

How It Works

When i = 7, the inner loop prints 1234567. When i = 5, it prints 12345, and so on until i = 1 prints 1. The outer loop skips even lengths because of the step -2. print() after the inner loop starts the next row.

📈 Practical Variant

Let the user choose the maximum row width at runtime.

Example 2 — Configurable Maximum

Read an odd maximum with input() and int() (wrap in try/except ValueError in real apps); if the user enters an even number, subtract 1.

Python

max_n = int(input("Enter an odd maximum (e.g., 9): "))

if max_n % 2 == 0:
    max_n -= 1

for i in range(max_n, 0, -2):
    for j in range(1, i + 1):
        print(j, end="")
    print()

How It Works

Same nested-loop core as Example 1; max_n comes from input and is forced odd with if max_n % 2 == 0: max_n -= 1. Non-numeric input raises ValueError with bare int(input()) — use try/except for safer labs.

⚡ Full Descending Triangle

Same ascending inner loop, but outer loop steps by 1 to include every width.

Example 3 — Step by 1 (`range(..., -1)`)

Print every row width from 7 down to 1 — includes even-length rows for comparison.

Python

max_n = 7

for i in range(max_n, 0, -1):
    for j in range(1, i + 1):
        print(j, end="")
    print()

How It Works

Changing the outer step from -2 to -1 includes every row width — even lengths like 123456 and 12 appear. Same inner loop; only the outer step changes the shape.

🧠 How the Algorithm Prints Rows

Set up

print() is built in; use input() when reading input. Set max_n (fixed or from input, forced odd if needed).

Setup

Outer loop (odd widths)

for i in range(max_n, 0, -2): picks odd row lengths only; inner loop prints 1..i.

Row

Inner loop (1..i)

for j in range(1, i + 1): prints ascending digits with print(j, end="") on every row.

Digits

New line

print() ends the row so the next outer iteration starts fresh.

Break

Odd-length triangle complete

Total digit prints: 1+2+…+n = n(n+1)/2 — O(n²) time, O(1) extra memory.

Trace

🔎 Worked Walkthrough — `max_n = 7`

Trace each outer-loop value of i and note the ascending digits printed on each odd-length row.

`i`	Step from prev	Inner `j` range	Printed row
`7`	start	`1..7`	`1234567`
`5`	`-2`	`1..5`	`12345`
`3`	`-2`	`1..3`	`123`
`1`	`-2`	`1..1`	`1`

Skipped even lengths: 6, 4, 2. Total digit prints: 7+5+3+1 = 16.

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: change j <= i and watch the shape change.

2. Pattern Series Base

Foundation for inverted, pyramid, diamond, and hollow variants.

Example: change range(..., -2) to range(..., -1) for a full descending triangle.

3. Console Formatting Drills

Practice print 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 j + " " for spaced digits on each row.

5. Complexity Intuition

Triangular totals make O(n²) concrete for beginners.

Example: count printed digits for n = 10 still → 55.

6. Input Validation Labs

Pair the pattern with input() return checks and positive-row validation.

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: learn step -2 first; compare with step -1 to see how the loop step changes the whole shape.

Usage Tips

Small habits that keep number-pattern code clean.

1. Name Bounds Clearly
Use max_n (avoid shadowing builtin max) and keep i/j for row/column — or rename to row/col.
2. Prefer try/except ValueError
Wrap int(input()) in try/except ValueError so bad input does not leave max_n unset.
3. Keep print() Outside
Only call print() after the inner loop finishes the row.
4. Force Odd Maximum
if max_n % 2 == 0: max_n -= 1 keeps the first row odd-length when reading input.
5. Dry-Run One Small n
Trace max_n = 7 on 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 odd-length descending number patterns.

1. Newline Inside the Inner Loop
Each digit lands on its own line — you get a column, not a triangle.
→ Use print(j, end="") for digits; print() only after the inner loop.
2. Wrong Outer Step
range(..., -1) prints every width; range(..., -2) starting from an even max_n skips the intended first row.
→ For odd-only rows, use for i in range(max_n, 0, -2) with odd max_n.
3. Forgetting the Row Break
Omitting print() glues every digit onto one endless line.
→ Always end the row after the inner loop.
4. Blind int(input())
Letters or empty input raise ValueError with bare int(input()).
→ Catch ValueError and re-prompt on failure.
5. Off-by-One on 0-Based Loops
Switching to a 0-based outer loop without adjusting the stop value can drop the last row or print an empty first row.
→ Prefer range(max_n, 0, -2) with range(1, i + 1) for the digits.

Edge Cases

Check these inputs before calling the solution done.

max_n = 1

Single digit

Output is just 1 on one line.

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.

Large n

Many rows

Output grows as n²/2 characters — fine for labs, noisy for huge n.

Bad input

Non-numeric input()

int(input()) raises ValueError — validate first.

Fill char

Even maximum input

Subtract 1 or prompt again — otherwise the first row may not match the odd-only rule.

Drill

🎯 Practice Problems

Try these variations to lock in the pattern.

1. Zigzag number triangle

Alternate direction with i % 2
Continue with Program 13

2. Alternating binary triangle

Print 0/1 with j % 2 on each row
Continue with Program 15

3. Even-width rows only

Start at an even max_n and use range(..., -2)
Prints 6, 4, 2, … instead of 7, 5, 3, 1

4. Right-aligned triangle

Add leading spaces before each row
Harder follow-up after this page

Important

Notes

Odd sum. Digit prints for odd widths 1+3+5+…+n still grow as O(n²) for maximum width n.
print(j, end="") stays on the line; print() advances — mix them carefully.
Validate max_n > 0 for interactive programs; max_n = 1 should print a single 1.
This page is left-aligned. Centered pyramids need leading spaces — covered later in the series.

Quick Takeaway: outer loop steps by 2 for odd widths, inner loop prints 1..i, then break the line.

Analysis

⏱️ Time and Space Complexity

Program	Time	Extra space
Nested loops (Examples 1–2)	`O(max²)`	`O(1)`
Step by 1 (Example 3)	`O(max²)`	`O(1)`

Wrap Up

🎉 Conclusion

The odd-length descending number triangle is a compact lesson in loop steps: range(..., -2) skips even widths while the inner loop always prints 1..i. Master the odd-only version, then compare with range(..., -1) for a full descending triangle.

Practice the three examples above, then continue to Program 15 for the alternating binary triangle.

Use range(max_n, 0, -2) for odd-only rows and for j in range(1, i + 1): for ascending digits — validate max_n when reading input.

View Examples Gallery Continue to Program 15

Pro Tips

💡 Best Practices

✅ Do

Explain step -2 skips even widths before coding
Use print(j, end="") for digits and print() after each row
Validate max_n ≥ 1 for interactive programs
Wrap int(input()) in try/except ValueError before using max_n
State O(n²) time when asked about complexity

❌ Don’t

Call print() inside the inner digit loop
Use range(..., -1) when you meant odd-only rows
Skip the newline after each row
Ignore bad console input in user-facing demos
Skip the max_n = 1 edge case

Summary

Key Takeaways

Knowledge Unlocked

Five things to remember about this odd-length pattern

Print the pattern the beginner-friendly way.

Core concepts

△ 01

Rule

Only odd row widths

Definition

↻ 02

Outer loop

Steps by 2 downward

Code

2 03

Inner loop

Always prints 1..i

Code

↵ 04

Newline

Ends each row

I/O

O 05

Complexity

O(n²) time

Analysis

❓ Frequently Asked Questions

Why do the row lengths decrease by 2?

The outer loop uses range(max_n, 0, -2), so it visits only odd widths: 7, 5, 3, 1. Even lengths like 6, 4, 2 are skipped.

Why does the pattern skip 123456?

Because the step of -2 skips even row lengths. After 1234567 (7 digits), the next row is 5 digits (12345), not 6.

What is the difference between print with end= and print()?

print(j, end="") stays on the same line. print() ends the current line. Digits use end=""; the row break uses print() after the inner loop.

How can I print even-length rows too?

Change the outer loop to range(max_n, 0, -1). Then you print 7, 6, 5, 4, 3, 2, 1 — every width.

How is this different from Program 13?

Program 13 alternates ascending/descending direction with i % 2 (12345, 4321, 123, 21, 1). Program 14 always prints 1..i but only for odd row lengths using a step of -2.

What is the time complexity?

O(n²) where n is the maximum row width. You print about 1+3+5+…+n odd-width digits, which is still O(n²).

What if the user enters an even maximum?

Subtract 1 to make it odd (e.g. if max_n % 2 == 0: max_n -= 1) so the first row stays odd-length, or document that even input shifts the pattern.

How should I read the maximum safely?

Use a try/except ValueError around int(input()) or check the raw string with .isdigit() before converting so bad input does not crash the script.

What happens if max_n is 0 or negative?

The outer loop never runs, so nothing is printed. Validate and prompt again if you want a clear user message.

Did you Know? 🔊

Only odd-length rows print. The outer loop uses range(..., -2) (7, 5, 3, 1) and the inner loop prints 1..i — still O(n²) total digit prints for maximum width n.

Continue to Program 15

Move on to the alternating binary number triangle in the Python number-pattern series.

Program 15 tutorial →

About the author

Mari Selvan M P 🔗

Developer, cloud engineer, and technical writer

Experience 12 years building web and cloud systems
Focus Full Stack Development, AWS, and Developer Education

I write practical tutorials so students and working developers can learn by doing—from databases and APIs to deployment on AWS.

AWS Certified Developer – Associate (Credly)

12 people found this page helpful

Python Number Pattern 13 — Alternating Zigzag Number Triangle Python Number Pattern 15 — Alternating Binary Triangle

Odd-Length Descending Number Triangle Pattern in Python

What You’ll Learn

Shape Rule

Outer Loop

Inner Loop

print end= vs print()

Live Preview

O(n²)

Introduction

Why it matters?

Step by 2

Always Ascending

Print Then Break

Series Foundation

📝 Problem & Approach

Inputs & Outputs

Minimal workflow

Approach comparison

⚡ Quick Reference

📋 Step by 2 vs Step by 1 vs Inner Loop

When This Pattern Shows Up

First lab exercise

Nested-loop warm-up

Console I/O practice

Gateway to variants

Not a UI layout tool

🔮 Live Preview

Examples Gallery

📚 Getting Started

Example 1 — Fixed max_n = 7

How It Works

📈 Practical Variant

Example 2 — Configurable Maximum

How It Works

⚡ Full Descending Triangle

Example 3 — Step by 1 (range(..., -1))

How It Works

🧠 How the Algorithm Prints Rows

Set up

Outer loop (odd widths)

Inner loop (1..i)

New line

Odd-length triangle complete

🔎 Worked Walkthrough — max_n = 7

Use Cases

1. Teaching Nested Loops

2. Pattern Series Base

3. Console Formatting Drills

4. Character Substitution

5. Complexity Intuition

6. Input Validation Labs

Advantages

1. Instant Visual Feedback

2. Minimal Concepts

3. Easy to Extend

4. O(1) Extra Memory

Usage Tips

1. Name Bounds Clearly

2. Prefer try/except ValueError

3. Keep print() Outside

4. Force Odd Maximum

5. Dry-Run One Small n

Common Pitfalls

1. Newline Inside the Inner Loop

2. Wrong Outer Step

3. Forgetting the Row Break

4. Blind int(input())

5. Off-by-One on 0-Based Loops

Edge Cases

Single digit

Empty pattern

max_n < 0

Many rows

Non-numeric input()

Even maximum input

🎯 Practice Problems

1. Zigzag number triangle

2. Alternating binary triangle

3. Even-width rows only

4. Right-aligned triangle

Example 1 — Fixed `max_n = 7`

Example 3 — Step by 1 (`range(..., -1)`)

🔎 Worked Walkthrough — `max_n = 7`

2. Prefer `try/except ValueError`

`max_n < 0`