Powers of 11 Pattern in JavaScript

What You’ll Learn

Program 48 prints the powers-of-11 sequence: 1, 11, 121, 1331, 14641 — a natural step after Program 47’s 2D concentric diamond. This tutorial covers a simple loop with running state (res *= 11), a live preview, worked JavaScript examples, edge cases, and complexity.

📝 Problem & Approach

Given row count n = 5, print the powers-of-11 sequence — one growing number per line, starting at 1 and multiplying by 11 each step.

// n = 5
// 1
// 11
// 121
// 1331
// 14641

Inputs & Outputs

Minimal workflow

let res = 1;
for (let i = 0; i < n; i++) {
  console.log(res);
  res *= 11;
}

Approach comparison

🔮 Live Preview

Choose row count n between 3 and 8 and generate the powers-of-11 sequence in the browser.

Press "Generate sequence".

Examples Gallery

Three complete JavaScript programs — fixed n = 5, prompt() input, and exponentiation with 11 ** power. Click View Output to reveal sample console results, or Try it Yourself to run the code live.

let res = 1;

for (let i = 0; i < 5; i++) {
  console.log(res);
  res *= 11;
}

1
11
121
1331
14641

const nInput = prompt("Enter number of lines:");
const n = parseInt(nInput, 10);

if (!Number.isFinite(n) || n < 1) {
  console.log("Please enter a positive integer.");
} else {
  let res = 1;
  for (let i = 0; i < n; i++) {
    console.log(res);
    res *= 11;
  }
}

Enter number of lines: 4
1
11
121
1331

const n = 5;

for (let power = 0; power < n; power++) {
  console.log(11 ** power);
}

1
11
121
1331
14641

🔎 Worked Walkthrough — n = 5

Trace each iteration — what res holds before and after the multiply step (print-then-multiply variant).

Row 6 would print 161051 — the first value where digit carries break the Pascal-triangle visual match, but the multiply loop still works correctly.

🎯 Practice Problems

Try these variations to lock in the pattern.

Notes

⏱️ Time and Space Complexity

💡 Best Practices