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.

Previous Showing 11-12 of 12 results.

A380452 Perfect powers k^m, m > 1, omega(k) > 1, such that A053669(k) > A006530(k) that are not also products of primorials, where omega = A001221.

Original entry on oeis.org

324, 2916, 5832, 8100, 11664, 22500, 26244, 72900, 90000, 104976, 157464, 202500, 236196, 291600, 360000, 396900, 419904, 562500, 656100, 729000, 944784, 1102500, 1259712, 1440000, 1822500, 1889568, 2125764, 2160900, 2250000, 2624400, 3375000, 3572100, 3779136
Offset: 1

Views

Author

Michael De Vlieger, Jul 25 2025

Keywords

Comments

Perfect powers k^m, m > 1, for composite k in A056808.
Terms are even. For a(n) such that omega(a(n)) > 2, a(n) mod 10 = 0, where omega = A001221.

Examples

			Table of n, a(n) for select n, showing exponents m of prime power factors p^m | a(n) for primes p listed in the heading:
                      Exponents
 n      a(n)          2.3.5
-------------------------------
 1      324 =  18^2   2.4
 2     2916 =  54^2   2.6
 3     5832 =  18^3   3.6
 4     8100 =  90^2   2.4.2
 5    11664 = 108^2   4.6
 6    22500 = 150^2   2.2.4
 7    26244 = 162^2   2.8
 8    72900 = 270^2   2.6.2
 9    90000 = 300^2   4.2.4
10   104976 =  18^4   4.8
11   157464 =  54^3   3.9
12   202500 = 450^2   2.4.4
		

Crossrefs

Programs

  • Mathematica
    (* Load linked Mathematica algorithm, then: *)
    Select[Union@ Flatten[a055932[7][[3 ;; -1, 2 ;; -1]] ], And[Divisible[#1, Apply[Times, #2[[All, 1]] ]^2], GCD @@ #2[[All, -1]] > 1] & @@ {#, FactorInteger[#]} &]

Formula

Intersection of A131605 and A056808 = A380446 \ A368682.
Set difference A380446 \ A025487.

A386433 Achilles numbers with a primorial squarefree kernel that are not products of primorials.

Original entry on oeis.org

108, 648, 972, 1944, 2700, 3888, 4500, 8748, 9000, 13500, 16200, 17496, 18000, 23328, 24300, 34992, 36000, 40500, 45000, 48600, 52488, 67500, 69984, 72000, 78732, 81000, 97200, 112500, 121500, 132300, 135000, 139968, 144000, 145800, 180000, 209952, 218700, 220500
Offset: 1

Views

Author

Michael De Vlieger, Jul 21 2025

Keywords

Examples

			Table of n, a(n), and A053669(a(n)) for n = 1..12.
 n     a(n)                    A053669(a(n))
--------------------------------------------
 1     108 = 2^2 * 3^3         5
 2     648 = 2^3 * 3^4         5
 3     972 = 2^2 * 3^5         5
 4    1944 = 2^3 * 3^5         5
 5    2700 = 2^2 * 3^3 * 5^2   7
 6    3888 = 2^4 * 3^5         5
 7    4500 = 2^2 * 3^2 * 5^3   7
 8    8748 = 2^2 * 3^7         5
 9    9000 = 2^3 * 3^2 * 5^3   7
10   13500 = 2^2 * 3^3 * 5^3   7
11   16200 = 2^3 * 3^4 * 5^2   7
12   17496 = 2^3 * 3^7         5
Let s = A052486.
The number 12 is not a term since it is not powerful (i.e., not in A001694).
The number 36, though powerful, is not a term since it is a perfect square.
s(1) = 72 is not in this sequence since rad(72) = P(2) = 6 and 72 = 2*6*6 = P(1)*P(2)*P(2).
s(2) = 108 = 3*6*6 is in the sequence since it is not a product of primorials.
The number 144, though powerful, is not a term because it is a perfect square.
s(3) = 200 is not a term because rad(200) = 10 = 2*5 is not also divisible by A053669(200) = 3.
s(4) = 288 is not in this sequence since rad(288) = P(2) = 6 and 288 = 2*2*2*6*6 = P(1)*P(1)*P(1)*P(2)*P(2), etc.
		

Crossrefs

Programs

  • Mathematica
    (* Load Fast Mathematica algorithm for A055932 linked at A377854, then: *)
    Select[Union@ Flatten[f[7][[3 ;; -1, 2 ;; -1]] ], And[Divisible[#1, Apply[Times, #2[[All, 1]] ]^2], GCD @@ #2[[;; , -1]] == 1, Max@ Differences[#2[[All, -1]] ] > 0] & @@ {#, FactorInteger[#]} &]

Formula

Let rad = A007947, omega = A001221, and P = A002110.
rad(a(n)) = P(omega(a(n))).
Intersection of A052486 and A056808 = A377854 \ A378002.
Previous Showing 11-12 of 12 results.