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.

A355432 a(n) = number of k < n such that rad(k) = rad(n) and k does not divide n, where rad(k) = A007947(k).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 2, 0, 0, 0, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 2, 0, 0, 1, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 4, 0, 2, 0, 2, 0, 0, 0, 0, 0, 0, 0, 4, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1
Offset: 1

Views

Author

Michael De Vlieger, Feb 22 2023

Keywords

Comments

a(n) = 0 for prime powers and squarefree numbers.

Examples

			a(1) = 18, since 18/6 >= 3. We note that rad(12) = rad(18) = 6, yet 12 does not divide 18.
a(2) = 24, since 24/6 >= 3. rad(18) = rad(24) = 6 and 24 mod 18 = 6.
a(3) = 36, since 36/6 >= 3. rad(24) = rad(36) = 6 and 36 mod 24 = 12.
a(6) = 54, since 54/6 >= 3. m in {12, 24, 36, 48} are such that rad(m) = rad(54) = 6, but none divides 54, etc.
		

Crossrefs

Programs

  • Mathematica
    rad[n_] := rad[n] = Times @@ FactorInteger[n][[All, 1]]; Table[Which[PrimePowerQ[n], 0, SquareFreeQ[n], 0, True, r = rad[n]; Count[Select[Range[n], Nor[PrimePowerQ[#], SquareFreeQ[#]] &], _?(And[rad[#] == r, Mod[n, #] != 0] &)]], {n, 120}]
  • PARI
    rad(n) = factorback(factorint(n)[, 1]); \\ A007947
    a(n) = my(rn=rad(n)); sum(k=1, n-1, if (n % k, rad(k)==rn)); \\ Michel Marcus, Feb 23 2023

Formula

a(n) > 0 for n in A360768.
a(n) < A243822(n) < A010846(n).
a(n) = A008479(n) - A005361(n). - Amiram Eldar, Oct 25 2024