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.

A054586 a(n) = Sum_{d|2n+1} phi(d)*mu(d).

This page as a plain text file.
%I A054586 #14 Aug 12 2023 04:37:01
%S A054586 1,-1,-3,-5,-1,-9,-11,3,-15,-17,5,-21,-3,-1,-27,-29,9,15,-35,11,-39,
%T A054586 -41,3,-45,-5,15,-51,27,17,-57,-59,5,33,-65,21,-69,-71,3,45,-77,-1,
%U A054586 -81,45,27,-87,55,29,51,-95,9,-99,-101,-15,-105,-107,35,-111,63,11,75,-9
%N A054586 a(n) = Sum_{d|2n+1} phi(d)*mu(d).
%D A054586 David M. Burton, Elementary Number Theory, Allyn and Bacon Inc., Boston, MA, 1976, p. 152.
%F A054586 a(n) = A276833(2*n+1). - _Amiram Eldar_, Aug 12 2023
%t A054586 a[n_] := DivisorSum[2*n+1, MoebiusMu[#]*EulerPhi[#]&]; Table[a[n], {n, 0, 70}] (* _Jean-François Alcover_, Dec 03 2015 *)
%t A054586 f[p_, e_] := 2-p; a[n_] := Times @@ f @@@ FactorInteger[2*n+1]; Array[a, 100, 0] (* _Amiram Eldar_, Aug 12 2023 *)
%o A054586 (PARI) j=[]; for(n=0,200,j=concat(j,sumdiv(2*n+1,d,moebius(d)*eulerphi(d)))); j
%Y A054586 Cf. A276833.
%K A054586 sign
%O A054586 0,3
%A A054586 _N. J. A. Sloane_, Apr 12 2000
%E A054586 Wrong formula deleted by _Amiram Eldar_, Aug 12 2023