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.

A057715 Numbers m = Product p_i^{e_i}, not a power of a prime, such that p_j^{e_j} > p_k^{e_k} for all p_j < p_k.

This page as a plain text file.
%I A057715 #27 May 27 2025 01:07:04
%S A057715 12,24,40,45,48,56,63,80,96,112,135,144,160,175,176,189,192,208,224,
%T A057715 275,288,297,320,325,351,352,384,405,416,425,448,459,475,513,539,544,
%U A057715 567,575,576,608,621,637,640,675,704,720,736,768,800,832,833,864,875
%N A057715 Numbers m = Product p_i^{e_i}, not a power of a prime, such that p_j^{e_j} > p_k^{e_k} for all p_j < p_k.
%H A057715 Lei Zhou, <a href="/A057715/b057715.txt">Table of n, a(n) for n = 1..10000</a>
%e A057715 720 is included because 720 = 2^4 * 3^2 * 5^1 and 2^4 > 3^2 > 5^1.
%t A057715 Select[Range[575], Greater @@ Power @@@ (fi = FactorInteger[#]) && Length[fi] > 1 &] (* _Ray Chandler_, Nov 06 2008 *)
%Y A057715 Subsequence of A085231, A097320, A126706.
%Y A057715 Cf. A363063.
%K A057715 nonn,easy
%O A057715 1,1
%A A057715 _Leroy Quet_, Oct 24 2000
%E A057715 Title clarified by _Sean A. Irvine_, Jun 24 2022 and _Peter Munn_, May 26 2025