cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A122819 Array read by rows in which the n-th row contains smallest odd numbers in increasing order of all possible prime signatures with n divisors.

Original entry on oeis.org

1, 3, 9, 15, 27, 81, 45, 243, 729, 105, 135, 2187, 225, 6561, 405, 19683, 59049, 315, 675, 1215, 177147, 531441, 3645, 1594323, 2025, 4782969, 945, 1155, 3375, 10935, 14348907, 43046721, 1575, 6075, 32805, 129140163, 387420489, 2835, 10125, 98415
Offset: 1

Views

Author

Ray Chandler, Sep 22 2006

Keywords

Comments

n-th row contains A001055(n) terms.
First item of each row gives A038547.

Examples

			Table begins:
  1,
  3,
  9,
  15, 27,
  81,
  45, 243,
  729,
  105, 135, 2187,
  ...
		

Crossrefs

Programs

  • Mathematica
    row[n_] := Module[{e = f[n] - 1}, Sort[Times @@ (Prime[Range[2, Length[#]+1]]^Reverse[#]) & /@ e]]; Table[row[n], {n, 1, 25}] // Flatten (* Amiram Eldar, Jun 28 2025 using the function f by T. D. Noe at A162247 *)