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.

A329733 Number of sequences n = b_1 < b_2 < ... < b_t = A329732(n) such that b_1*b_2*...*b_t is a perfect cube.

Original entry on oeis.org

1, 1, 1, 2, 2, 4, 2, 6, 1, 1, 1, 68, 1, 180, 4, 2, 1, 2968, 1, 31724, 2, 2, 8
Offset: 0

Views

Author

Peter Kagey, Nov 19 2019

Keywords

Comments

Conjecture: records are at 0 and the odd primes.

Examples

			For n = 5, the a(5) = 4 sequences are
5 *  6 *  9 * 10 * 15 * 18      = 90^3,
5 *  6 *  8 *  9 * 10 * 15 * 18 = 180^3,
5 * 10 * 15 * 16 * 18           = 60^3, and
5 *  8 * 10 * 15 * 16 * 18      = 120^3.
		

Crossrefs

Cf. A329732.