A080771 Duplicate of A025477.
0, 2, 3, 2, 4, 2, 3, 5, 2, 6, 4, 2, 3, 7, 2, 5, 8, 2, 3, 2, 9, 2, 4, 6, 2, 2, 10, 3, 2, 2, 2, 11, 7, 3
Offset: 1
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.
Let b(n) = A005117(n). a(1) = 1 since 1 is the only number k <= b(1) such that rad(k) | 1. a(2) = 2 since k in {1, 2} are such that rad(k) | 2. a(5) = 5 since b(5) = 6, k in {1, 2, 3, 4, 6} are such that rad(k) | 6. That is, 6 appears in the 5th position in S_6 = A003586. a(7) = 6 since b(7) = 10, Card({ k : k <= 10, rad(k) | 10 }) = Card({1, 2, 4, 5, 8, 10}) = 6. That is, 10 appears in the 6th position in S_10 = A003592, etc.
rad[x_] := Times @@ FactorInteger[x][[All, 1]]; Map[Function[{m, r}, Count[Range[m], _?(Divisible[r, rad[#] ] &)]] @@ {#, rad[#]} &, Select[Range[2^10], SquareFreeQ]]
from math import gcd, isqrt from sympy import mobius def A363924(n): def f(x): return n+x-sum(mobius(k)*(x//k**2) for k in range(1, isqrt(x)+1)) m, k = n, f(n) while m != k: m, k = k, f(k) return int(sum(mobius(k)*(m//k) for k in range(1,m+1) if gcd(m,k)==1)) # Chai Wah Wu, Aug 15 2024
Comments