|
%I #139 Jan 28 2024 09:01:25
%S 1,1,1,2,1,1,1,4,3,1,1,2,1,1,1,8,1,3,1,2,1,1,1,4,5,1,9,2,1,1,1,16,1,1,
%T 1,6,1,1,1,4,1,1,1,2,3,1,1,8,7,5,1,2,1,9,1,4,1,1,1,2,1,1,3,32,1,1,1,2,
%U 1,1,1,12,1,1,5,2,1,1,1,8,27,1,1,2,1,1,1,4,1,3,1,2,1,1,1,16,1,7
%N n divided by largest squarefree divisor of n; if n = Product p(k)^e(k) then a(n) = Product p(k)^(e(k)-1), with a(1) = 1.
%C a(n) is the size of the Frattini subgroup of the cyclic group C_n - Ahmed Fares (ahmedfares(AT)my-deja.com), Jun 07 2001.
%C Also of the Frattini subgroup of the dihedral group with 2*n elements. - Sharon Sela (sharonsela(AT)hotmail.com), Jan 01 2002
%C Number of solutions to x^m==0 (mod n) provided that n < 2^(m+1), i.e. the sequence of sequences A000188, A000189, A000190, etc. converges to this sequence. - _Henry Bottomley_, Sep 18 2001
%C a(n) is the number of nilpotent elements in the ring Z/nZ. - _Laszlo Toth_, May 22 2009
%C The sequence of partial products of a(n) is A085056(n). - _Peter Luschny_, Jun 29 2009
%C The first occurrence of n in this sequence is at A064549(n). - _Franklin T. Adams-Watters_, Jul 25 2014
%H Reinhard Zumkeller, <a href="/A003557/b003557.txt">Table of n, a(n) for n = 1..10000</a>
%H Henry Bottomley, <a href="http://fs.gallup.unm.edu/Bottomley-Sm-Mult-Functions.htm">Some Smarandache-type multiplicative sequences</a>.
%H Steven R. Finch, <a href="https://arxiv.org/abs/math/0605019">Idempotents and Nilpotents Modulo n</a>, arXiv:math/0605019 [math.NT], 2006-2017.
%F Multiplicative with a(p^e) = p^(e-1). - _Vladeta Jovovic_, Jul 23 2001
%F a(n) = n/rad(n) = n/A007947(n) = sqrt(J_2(n)/J_2(rad(n))), where J_2(n) is A007434. - _Enrique Pérez Herrero_, Aug 31 2010
%F a(n) = (J_k(n)/J_k(rad(n)))^(1/k), where J_k is the k-th Jordan Totient Function: (J_2 is A007434 and J_3 A059376). - _Enrique Pérez Herrero_, Sep 03 2010
%F Dirichlet convolution of A000027 and A097945. - _R. J. Mathar_, Dec 20 2011
%F a(n) = A000010(n)/|A023900(n)|. - _Eric Desbiaux_, Nov 15 2013
%F a(n) = Product_{k = 1..A001221(n)} (A027748(n,k)^(A124010(n,k)-1)). - _Reinhard Zumkeller_, Dec 20 2013
%F a(n) = Sum_{k=1..n}(floor(k^n/n)-floor((k^n-1)/n)). - _Anthony Browne_, May 11 2016
%F a(n) = e^[Sum_{k=2..n} (floor(n/k)-floor((n-1)/k))*(1-A010051(k))*Mangoldt(k)] where Mangoldt is the Mangoldt function. - _Anthony Browne_, Jun 16 2016
%F a(n) = Sum_{d|n} mu(d) * phi(d) * (n/d), where mu(d) is the Moebius function and phi(d) is the Euler totient function (rephrases formula of Dec 2011). - _Daniel Suteu_, Jun 19 2018
%F G.f.: Sum_{k>=1} mu(k)*phi(k)*x^k/(1 - x^k)^2. - _Ilya Gutkovskiy_, Nov 02 2018
%F Dirichlet g.f.: Product_{primes p} (1 + 1/(p^s - p)). - _Vaclav Kotesovec_, Jun 24 2020
%F From _Richard L. Ollerton_, May 07 2021: (Start)
%F a(n) = Sum_{k=1..n} mu(n/gcd(n,k))*gcd(n,k).
%F a(n) = Sum_{k=1..n} mu(gcd(n,k))*(n/gcd(n,k))*phi(gcd(n,k))/phi(n/gcd(n,k)). (End)
%F a(n) = A001615(n)/A048250(n) = A003415/A342001(n) = A057521(n)/A071773(n). - _Antti Karttunen_, Jun 08 2021
%p A003557 := n -> n/ilcm(op(numtheory[factorset](n))):
%p seq(A003557(n), n=1..98); # _Peter Luschny_, Mar 23 2011
%p seq(n / NumberTheory:-Radical(n), n = 1..98); # _Peter Luschny_, Jul 20 2021
%t Prepend[ Array[ #/Times@@(First[ Transpose[ FactorInteger[ # ] ] ])&, 100, 2 ], 1 ] (* _Olivier Gérard_, Apr 10 1997 *)
%o (Sage) def A003557(n) : return n*mul(1/p for p in prime_divisors(n))
%o [A003557(n) for n in (1..98)] # _Peter Luschny_, Jun 10 2012
%o (Haskell)
%o a003557 n = product $ zipWith (^)
%o (a027748_row n) (map (subtract 1) $ a124010_row n)
%o -- _Reinhard Zumkeller_, Dec 20 2013
%o (PARI) a(n)=n/factorback(factor(n)[,1]) \\ _Charles R Greathouse IV_, Nov 17 2014
%o (PARI) for(n=1, 100, print1(direuler(p=2, n, (1 - p*X + X)/(1 - p*X))[n], ", ")) \\ _Vaclav Kotesovec_, Jun 20 2020
%o (Python)
%o from sympy.ntheory.factor_ import core
%o from sympy import divisors
%o def a(n): return n / max(i for i in divisors(n) if core(i) == i)
%o print([a(n) for n in range(1, 101)]) # _Indranil Ghosh_, Apr 16 2017
%o (Python)
%o from math import prod
%o from sympy import primefactors
%o def A003557(n): return n//prod(primefactors(n)) # _Chai Wah Wu_, Nov 04 2022
%o (Magma) [(&+[(Floor(k^n/n)-Floor((k^n-1)/n)): k in [1..n]]): n in [1..100]]; // _G. C. Greubel_, Nov 02 2018
%o (Julia)
%o using Nemo
%o function A003557(n)
%o n < 4 && return 1
%o q = prod([p for (p, e) ∈ Nemo.factor(fmpz(n))])
%o return n == q ? 1 : div(n, q)
%o end
%o [A003557(n) for n in 1:90] |> println # _Peter Luschny_, Feb 07 2021
%Y Cf. A007947, A062378, A062379, A064549, A300717 (Möbius transform), A326306 (inv. Möbius transf.), A328572.
%Y Sequences that are multiples of this sequence (the other factor of a pointwise product is given in parentheses): A000010 (A173557), A000027 (A007947), A001615 (A048250), A003415 (A342001), A007434 (A345052), A057521 (A071773).
%Y Cf. A082695 (Dgf at s=2), A065487 (Dgf at s=3).
%K nonn,easy,mult
%O 1,4
%A _Marc LeBrun_
%E Secondary definition added to the name by _Antti Karttunen_, Jun 08 2021
|
