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.

A072412 Numbers k such that the LCM of exponents in the prime factorization of k does not equal the largest exponent.

This page as a plain text file.
%I A072412 #14 Jul 30 2022 19:40:08
%S A072412 72,108,200,288,360,392,432,500,504,540,600,648,675,756,792,800,864,
%T A072412 936,968,972,1125,1152,1176,1188,1224,1323,1350,1352,1368,1372,1400,
%U A072412 1404,1440,1500,1568,1656,1800,1836,1944,1960,2000,2016,2052,2088,2160
%N A072412 Numbers k such that the LCM of exponents in the prime factorization of k does not equal the largest exponent.
%C A072412 This sequence differs from the Achilles numbers (A052486).
%H A072412 Amiram Eldar, <a href="/A072412/b072412.txt">Table of n, a(n) for n = 1..10000</a>
%F A072412 A051903(a(n)) != A072411(a(n)).
%e A072412 k = 360 = 2*2*2*3*3*5, exponent set = {3,2,1}; LCM=6, max=3.
%t A072412 Select[Range[2000], LCM @@ (e = FactorInteger[#][[;; , 2]]) != Max[e] &] (* _Amiram Eldar_, Jul 30 2022 *)
%o A072412 (PARI) is(n)=my(f=factor(n)[,2]); n>9 && vecmax(f)!=lcm(f) \\ _Charles R Greathouse IV_, Oct 16 2015
%Y A072412 Cf. A005361, A051903, A051904, A052409, A052486, A072411, A072413, A072414.
%K A072412 nonn
%O A072412 1,1
%A A072412 _Labos Elemer_, Jun 17 2002