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.
%I A072414 #21 Aug 20 2024 07:47:36
%S A072414 360,504,540,600,756,792,936,1176,1188,1224,1350,1368,1400,1404,1440,
%T A072414 1500,1656,1836,1960,2016,2052,2088,2160,2200,2232,2250,2400,2484,
%U A072414 2520,2600,2646,2664,2904,2952,3024,3096,3132,3168,3240,3348,3384,3400,3500
%N A072414 Non-Achilles numbers for which LCM of the exponents in the prime factorization of n is not equal to the maximum of the same exponents.
%C A072414 Most members of this sequence fail to be Achilles numbers because they have at least one prime factor with multiplicity 1. There are also numbers in the sequence that fail to be Achilles numbers because they are perfect powers: these are precisely the proper powers of members of A072412, so the smallest such is 5184 = 2^6*3^4 = 72^2. - _Franklin T. Adams-Watters_, Oct 09 2006
%H A072414 Michael De Vlieger, <a href="/A072414/b072414.txt">Table of n, a(n) for n = 1..10000</a>
%F A072414 A051903(a(n)) is not equal A072411(a(n)) but the numbers are not in A052486.
%e A072414 m = 504 = 2*2*2*3*3*7: exponent-set = E = {3,2,1}, max(E) = 3 < lcm(E) = 6, gcd(E) = min(E) = 1.
%t A072414 Select[Range@ 3500, And[LCM @@ # != Max@ #, GCD @@ # == Min@ # == 1] &[FactorInteger[#][[All, -1]] ] &] (* _Michael De Vlieger_, Jul 18 2017 *)
%o A072414 (PARI) is(n)=my(f=factor(n)[,2]); n>9 && lcm(f)!=vecmax(f) && (#f==1 || vecmin(f)<2) \\ _Charles R Greathouse IV_, Oct 16 2015
%Y A072414 Cf. A005361, A051903, A051904, A052409, A072411, A072412, A052486.
%K A072414 nonn
%O A072414 1,1
%A A072414 _Labos Elemer_, Jun 17 2002