|
%I #13 Sep 13 2018 02:41:47
%S 1,3,5,23,9,15,13,91,59,27,21,115,25,39,45,1451,33,177,37,207,65,63,
%T 45,455,179,75,353,299,57,135,61,5797,105,99,117,1357,73,111,125,819,
%U 81,195,85,483,531,135,93,7255,363,537,165,575,105,1059,189,1183,185,171,117,1035,121,183,767,46355,225,315,133,759,225,351,141,5369
%N Numerators of the sequence whose Dirichlet convolution with itself yields A018804, Pillai's arithmetical function: Sum_{k=1..n} gcd(k, n).
%C Because A018804 gets only odd values on primes, A046644 gives the sequence of denominators. Because both of those sequences are multiplicative, this is also.
%H Antti Karttunen, <a href="/A318443/b318443.txt">Table of n, a(n) for n = 1..16384</a>
%F a(n) = numerator of f(n), where f(1) = 1, f(n) = (1/2) * (A018804(n) - Sum_{d|n, d>1, d<n} f(d) * f(n/d)) for n > 1.
%t a18804[n_] := Sum[n EulerPhi[d]/d, {d, Divisors[n]}];
%t f[1] = 1; f[n_] := f[n] = 1/2 (a18804[n] - Sum[f[d] f[n/d], {d, Divisors[ n][[2 ;; -2]]}]);
%t a[n_] := f[n] // Numerator;
%t Array[a, 72] (* _Jean-François Alcover_, Sep 13 2018 *)
%o (PARI)
%o up_to = 16384;
%o A018804(n) = sumdiv(n, d, n*eulerphi(d)/d); \\ From A018804
%o DirSqrt(v) = {my(n=#v, u=vector(n)); u[1]=1; for(n=2, n, u[n]=(v[n]/v[1] - sumdiv(n, d, if(d>1&&d<n, u[d]*u[n/d], 0)))/2); u}; \\ From A317937.
%o v318443aux = DirSqrt(vector(up_to, n, A018804(n)));
%o A318443(n) = numerator(v318443aux[n]);
%Y Cf. A018804, A046644 (denominators).
%Y Cf. also A318444.
%K nonn,frac,mult
%O 1,2
%A _Antti Karttunen_ and _Andrew Howroyd_, Aug 29 2018
|
