New: 77 pattern programs with tested code in C, C++, Java and Python Explore patterns

Continuous Odd Number Triangle

Read summary with AI tools
Table of contents
  1. Output
  2. How the continuous odd number triangle works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Related patterns

Like Floyd’s triangle, but the odd numbers continue from one row to the next. This tutorial shows the output, a row-by-row diagram and the complete program in C, C++, Java and Python.

This program is part of the Series Patterns collection.

Continuous Odd Number Triangle output

Output (n = 5):

  1
  3  5
  7  9 11
 13 15 17 19
 21 23 25 27 29
Continuous Odd Number Triangle layout diagram, row by row (n = 5)
The numbers of the continuous odd number triangle laid out row by row (n = 5).

How the continuous odd number triangle works

Take the Floyd’s triangle position k = i(i − 1)/2 + j and print the k-th odd number, 2k − 1.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Print i numbers (value 2 × (i × (i − 1) / 2 + j) − 1).
  3. Move to the next line.

Continuous Odd Number Triangle in C

#include <stdio.h>

int main(void) {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            printf("%3d", 2 * (i * (i - 1) / 2 + j) - 1);
        printf("\n");
    }
    return 0;
}

Continuous Odd Number Triangle in C++

#include <iostream>
#include <iomanip>
using namespace std;

int main() {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            cout << setw(3) << 2 * (i * (i - 1) / 2 + j) - 1;
        cout << endl;
    }
    return 0;
}

Continuous Odd Number Triangle in Java

public class ContinuousOddNumberTriangle {
    public static void main(String[] args) {
        int n = 5;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++)
                System.out.printf("%3d", 2 * (i * (i - 1) / 2 + j) - 1);
            System.out.println();
        }
    }
}

Continuous Odd Number Triangle in Python

n = 5

for i in range(1, n + 1):
    for j in range(1, i + 1):
        print(f"{2 * (i * (i - 1) // 2 + j) - 1: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).

Authored by

Ghanendra Yadav runs Pattern Programs from Bangalore, India. The site started in 2020 to help students practise loops and logic through pattern programs in C, C++, Java and Python. Every program published here is compiled and run before it goes live, and the output shown is the real output.

Latest articles

Leave a comment

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.