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

Consecutive Number-Star Triangle (1, 2*3, 4*5*6)

Read summary with AI tools
Table of contents
  1. Consecutive Number-Star Triangle output
  2. How the consecutive number-star triangle works
  3. Consecutive Number-Star Triangle in C
  4. Consecutive Number-Star Triangle in C++
  5. Consecutive Number-Star Triangle in Java
  6. Consecutive Number-Star Triangle in Python
  7. Time and space complexity
  8. Related patterns

Floyd’s triangle with a star between neighbouring numbers. The logic is explained step by step, and the full program is given in C, C++, Java and Python.

This program is part of the Number-Star Patterns collection.

Consecutive Number-Star Triangle output

Output (n = 4):

1
2*3
4*5*6
7*8*9*10
Consecutive Number-Star Triangle layout diagram, row by row (n = 4)
How each row of the consecutive number-star triangle is built (n = 4). Blue cells are printed characters; grey dots are spaces.

How the consecutive number-star triangle works

The number at odd position j of row i is i(i − 1)/2 + (j + 1)/2, which is Floyd’s formula with the stars skipped.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Go through 2 × i − 1 positions in the row. Print numbers (value i × (i − 1) / 2 + (j + 1) / 2) where j % 2 = 1; print stars everywhere else.
  3. Move to the next line.

Consecutive Number-Star Triangle in C

#include <stdio.h>

int main(void) {
    int n = 4;

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

Consecutive Number-Star Triangle in C++

#include <iostream>
using namespace std;

int main() {
    int n = 4;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 2 * i - 1; j++) {
            if (j % 2 == 1)
                cout << i * (i - 1) / 2 + (j + 1) / 2;
            else
                cout << "*";
        }
        cout << endl;
    }
    return 0;
}

Consecutive Number-Star Triangle in Java

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

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= 2 * i - 1; j++) {
                if (j % 2 == 1)
                    System.out.print(i * (i - 1) / 2 + (j + 1) / 2);
                else
                    System.out.print("*");
            }
            System.out.println();
        }
    }
}

Consecutive Number-Star Triangle in Python

n = 4

for i in range(1, n + 1):
    for j in range(1, 2 * i):
        if j % 2 == 1:
            print(i * (i - 1) // 2 + (j + 1) // 2, end="")
        else:
            print("*", 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.