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.

A123118 Partial products of A101695.

Original entry on oeis.org

2, 12, 216, 8640, 933120, 209018880, 100329062400, 130026464870400, 349511137571635200, 1968446726803449446400, 22676506292775737622528000, 522466704985552994823045120000, 27820307107070725868337506549760000
Offset: 1

Views

Author

Jonathan Vos Post, Sep 28 2006

Keywords

Comments

The number of prime factors (with multiplicity) of a(n) is T(n) = A000217(n) = n*(n+1)/2.

Examples

			a(1) = 2 = prime(1).
a(2) = 12 = 2 * 6 = prime(1) * semiprime(2) = 2^2 * 3.
a(3) = 216 = 2 * 6 * 18 = prime(1) * semiprime(2) * 3-almostprime(3) = 2^3 * 3^3.
a(4) = 8640 = 2 * 6 * 18 * 40 = prime(1) * semiprime(2) * 3-almostprime(3) * 4-almostprime(4) = 2^6 * 3^3 * 5.
a(15) = 893179304874387947794472921245209518407680000 = 2 * 6 * 18 * 40 * 108 * 224 * 480 * 1296 * 2688 * 5632 * 11520 * 23040 * 53248 * 124416 * 258048 = 2^88 * 3^23 * 5^4 * 7^3 * 11 * 13.
		

Crossrefs

Formula

a(n) = Prod[i=1..n] i-th i-almost prime = Prod[i=1..n] A101695(i).