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.

Showing 1-2 of 2 results.

A365786 a(n) = squarefree kernel of A286708(n).

Original entry on oeis.org

6, 6, 10, 6, 6, 14, 10, 6, 15, 6, 6, 14, 10, 6, 21, 22, 10, 6, 6, 15, 26, 14, 10, 6, 30, 22, 6, 10, 33, 15, 6, 34, 35, 6, 21, 26, 14, 38, 39, 14, 10, 6, 42, 30, 22, 6, 10, 15, 46, 6, 34, 10, 6, 51, 30, 26, 14, 38, 6, 55, 21, 14, 10, 57, 33, 58, 15, 6, 42, 30, 62
Offset: 1

Views

Author

Michael De Vlieger, Sep 19 2023

Keywords

Comments

Terms are squarefree and composite, i.e., in A120944.

Examples

			Let b(n) = A286708(n) and let squarefree kernel rad(n) = A007947(n).
a(1) = 6 = rad(b(1)) = rad(36).
a(2) = 6 = rad(b(2)) = rad(72).
a(3) = 10 = rad(b(3)) = rad(100), etc.
		

Crossrefs

Programs

  • Mathematica
    With[{nn = 2^12}, Map[Times @@ FactorInteger[#][[All, 1]] &, Rest@ Select[Union@ Flatten@ Table[a^2*b^3, {b, nn^(1/3)}, {a, Sqrt[nn/b^3]}], Not @* PrimePowerQ]] ]
  • PARI
    apply(x->factorback(factorint(x)[, 1]), select(x->((x>1) && ispowerful(x) && !isprimepower(x)), [1..5000])) \\ Michel Marcus, Sep 20 2023

Formula

a(n) = A007947(A286708(n)).

A362972 Squarefree kernels of cubefull numbers (A036966).

Original entry on oeis.org

1, 2, 2, 3, 2, 2, 3, 5, 2, 6, 3, 2, 7, 6, 2, 5, 6, 3, 6, 10, 2, 6, 11, 6, 6, 10, 2, 3, 13, 7, 6, 14, 5, 15, 6, 6, 10, 2, 17, 10, 6, 14, 6, 3, 19, 6, 6, 10, 2, 21, 10, 15, 6, 22, 14, 6, 23, 6, 11, 6, 5, 10, 2, 7, 15, 6, 26, 14, 3, 10, 6, 22, 14, 6, 29, 10, 30, 6
Offset: 1

Views

Author

Amiram Eldar, May 13 2023

Keywords

Examples

			A036966(2) = 8 = 2^3, therefore a(2) = 2.
A036966(10) = 216 = 2^3 * 3^2, therefore a(10) = 2 * 3 = 6.
		

Crossrefs

Programs

  • Mathematica
    seq[kmax_] := Module[{s = {1}}, Do[f = FactorInteger[k]; If[Min@f[[;; , 2]] > 2, AppendTo[s, Times @@ f[[;; , 1]]]], {k, 2, kmax}]; s]; seq[10^5]
  • PARI
    lista(kmax) = {my(f); for(k = 1, kmax, f = factor(k); if(k==1 || vecmin(f[, 2]) > 2, print1(vecprod(f[, 1]), ", ")));}

Formula

a(n) = A007947(A036966(n)).
Sum_{A036966(k) < x} a(k) = c * x^(2/3) + o(x^(2/3)), where c = (3/Pi^2) * Product_{p prime} (1 + 1/((p+1)*(p^(2/3)-1))) = 0.7356919531... (Jakimczuk, 2017). [corrected Sep 21 2024]
Sum_{k=1..n} a(k) ~ (c / A362974 ^ 2) * n^2, where c is the constant above.
Showing 1-2 of 2 results.