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.

This page as a plain text file.
%I A329733 #8 Nov 23 2019 21:06:22
%S A329733 1,1,1,2,2,4,2,6,1,1,1,68,1,180,4,2,1,2968,1,31724,2,2,8
%N 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.
%C A329733 Conjecture: records are at 0 and the odd primes.
%e A329733 For n = 5, the a(5) = 4 sequences are
%e A329733 5 *  6 *  9 * 10 * 15 * 18      = 90^3,
%e A329733 5 *  6 *  8 *  9 * 10 * 15 * 18 = 180^3,
%e A329733 5 * 10 * 15 * 16 * 18           = 60^3, and
%e A329733 5 *  8 * 10 * 15 * 16 * 18      = 120^3.
%Y A329733 Cf. A329732.
%K A329733 nonn,more
%O A329733 0,4
%A A329733 _Peter Kagey_, Nov 19 2019