A317932 -id:A317932 - cp's OEIS frontend

A046644 From square root of Riemann zeta function: form Dirichlet series Sum b_n/n^s whose square is zeta function; sequence gives denominator of b_n.

1, 2, 2, 8, 2, 4, 2, 16, 8, 4, 2, 16, 2, 4, 4, 128, 2, 16, 2, 16, 4, 4, 2, 32, 8, 4, 16, 16, 2, 8, 2, 256, 4, 4, 4, 64, 2, 4, 4, 32, 2, 8, 2, 16, 16, 4, 2, 256, 8, 16, 4, 16, 2, 32, 4, 32, 4, 4, 2, 32, 2, 4, 16, 1024, 4, 8, 2, 16, 4, 8, 2, 128, 2, 4, 16, 16, 4, 8

Offset: 1

N. J. A. Sloane

From Antti Karttunen, Aug 21 2018: (Start)

a(n) is the denominator of any rational-valued sequence f(n) which has been defined as f(n) = (1/2) * (b(n) - Sum_{d|n, d>1, d

Proof:

Proof is by induction. We assume as our induction hypothesis that the given multiplicative formula for A046644 (resp. additive formula for A046645) holds for all proper divisors d|n, dA046645(p) = 1. [Remark: for squares of primes, f(p^2) = (4*b(p^2) - 1)/8, thus a(p^2) = 8.]

First we note that A005187(x+y) <= A005187(x) + A005187(y), with equivalence attained only when A004198(x,y) = 0, that is, when x and y do not have any 1-bits in the shared positions. Let m = Sum_{e} A005187(e), with e ranging over the exponents in prime factorization of n.

For [case A] any n in A268388 it happens that only when d (and thus also n/d) are infinitary divisors of n will Sum_{e} A005187(e) [where e now ranges over the union of multisets of exponents in the prime factorizations of d and n/d] attain value m, which is the maximum possible for such sums computed for all divisor pairs d and n/d. For any n in A268388, A037445(n) = 2^k, k >= 2, thus A037445(n) - 2 = 2 mod 4 (excluding 1 and n from the count, thus -2). Thus, in the recursive formula above, the maximal denominator that occurs in the sum is 2^m which occurs k times, with k being an even number, but not a multiple of 4, thus the factor (1/2) in the front of the whole sum will ensure that the denominator of the whole expression is 2^m [which thus is equal to 2^A046645(n) = a(n)].

On the other hand [case B], for squares in A050376 (A082522, numbers of the form p^(2^k) with p prime and k>0), all the sums A005187(x)+A005187(y), where x+y = 2^k, 0 < x <= y < 2^k are less than A005187(2^k), thus it is the lonely "middle pair" f(p^(2^(k-1))) * f(p^(2^(k-1))) among all the pairs f(d)*f(n/d), 1 < d < n = p^(2^k) which yields the maximal denominator. Furthermore, as it occurs an odd number of times (only once), the common factor (1/2) for the whole sum will increase the exponent of 2 in denominator by one, which will be (2*A005187(2^(k-1))) + 1 = A005187(2^k) = A046645(p^(2^k)).

(End)

From Antti Karttunen, Aug 21 2018: (Start)

The following list gives a few such pairs num(n), b(n) for which b(n) is Dirichlet convolution of num(n)/a(n). Here ε stands for sequence A063524 (1, 0, 0, ...).

Numerators Dirichlet convolution of numerator(n)/a(n) yields

------- -----------

A046643 A000012

A257098 A008683

A317935 A003557

A318321 A003961

A317830 A175851

A317833 A078898

A317834 A078899

A317847 A303757

A317835 ε + A003415

A317845 ε + A001065

A317846 ε + A051953

A317936 ε + A100995

A317937 ε + A001221

A317938 ε + A001222

A317939 ε + A010051 (= A080339)

(End)

This sequence gives an upper bound for the denominators of any rational-valued sequence obtained as the "Dirichlet Square Root" of any integer-valued sequence. - Andrew Howroyd, Aug 23 2018

Antti Karttunen, Table of n, a(n) for n = 1..8192
Wikipedia, Dirichlet convolution
Index entries for sequences computed from exponents in factorization of n

Cf. A000079, A005187, A028234, A037445, A050376, A067029, A082522, A268388.
See A046643 for more details. See also A046645, A317940.
Cf. A299150, A299152, A317832, A317926, A317932, A317934 (for denominator sequences of other similar constructions).

b[1] = 1; b[n_] := b[n] = (dn = Divisors[n]; c = 1;
Do[c = c - b[dn[[i]]]*b[n/dn[[i]]], {i, 2, Length[dn] - 1}]; c/2); a[n_] := Denominator[b[n]]; a /@ Range[78] (* Jean-François Alcover, Apr 04 2011, after Maple code in A046643 *)
a18804[n_] := Sum[n EulerPhi[d]/d, {d, Divisors[n]}];
f[1] = 1; f[n_] := f[n] = 1/2 (a18804[n] - Sum[f[d] f[n/d], {d, Divisors[ n][[2 ;; -2]]}]);
a[n_] := f[n] // Denominator;
Array[a, 78] (* Jean-François Alcover, Sep 13 2018, after A318443 *)

A046643perA046644(n) = { my(c=1); if(1==n,c,fordiv(n,d, if((d>1)&&(dA046643perA046644(d)*A046643perA046644(n/d)))); (c/2)); }
A046644(n) = denominator(A046643perA046644(n)); \\ After the Maple-program given in A046643, Antti Karttunen, Jul 08 2017

A005187(n) = { my(s=n); while(n>>=1, s+=n); s; };
A046644(n) = factorback(apply(e -> 2^A005187(e),factor(n)[,2])); \\ Antti Karttunen, Aug 12 2018

for(n=1, 100, print1(denominator(direuler(p=2, n, 1/(1-X)^(1/2))[n]), ", ")) \\ Vaclav Kotesovec, May 04 2025

;; With memoization-macro definec.
(definec (A046644 n) (if (= 1 n) n (* (A000079 (A005187 (A067029 n))) (A046644 (A028234 n))))) ;; Antti Karttunen, Jul 08 2017

From Antti Karttunen, Jul 08 2017: (Start)
Multiplicative with a(p^n) = 2^A005187(n).
a(1) = 1; for n > 1, a(n) = A000079(A005187(A067029(n))) * a(A028234(n)).
a(n) = A000079(A046645(n)).
(End)
Sum_{j=1..n} A046643(j)/A046644(j) ~ n / sqrt(Pi*log(n)) * (1 + (1 - gamma/2)/(2*log(n))), where gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, May 04 2025

A299150 Denominators of the positive solution to n = Sum_{d|n} a(d) * a(n/d).

Original entry on oeis.org

1, 1, 2, 2, 2, 2, 2, 2, 8, 2, 2, 4, 2, 2, 4, 8, 2, 8, 2, 4, 4, 2, 2, 4, 8, 2, 16, 4, 2, 4, 2, 8, 4, 2, 4, 16, 2, 2, 4, 4, 2, 4, 2, 4, 16, 2, 2, 16, 8, 8, 4, 4, 2, 16, 4, 4, 4, 2, 2, 8, 2, 2, 16, 16, 4, 4, 2, 4, 4, 4, 2, 16, 2, 2, 16, 4, 4, 4, 2, 16, 128, 2, 2

Offset: 1

Gus Wiseman, Feb 03 2018

			Sequence begins: 1, 1, 3/2, 3/2, 5/2, 3/2, 7/2, 5/2, 27/8, 5/2, 11/2, 9/4, 13/2, 7/2.

Antti Karttunen, Table of n, a(n) for n = 1..65537 (first 1000 terms from Andrew Howroyd)

Cf. A000010, A003958, A005187, A006519, A007431, A011371, A018804, A023900, A029935, A037445, A046643, A046644, A165825, A257098, A298971, A299119, A299149 (numerators), A299151, A317848, A317929, A317932, A318314, A318512, A318653, A318681.

Cf. A318440 (the 2-adic valuation).

nn=50;
sys=Table[n==Sum[a[d]*a[n/d],{d,Divisors[n]}],{n,nn}];
Denominator[Array[a,nn]/.Solve[sys,Array[a,nn]][[2]]]
f[p_, e_] := 2^((1 + Mod[p, 2])*e - DigitCount[e, 2, 1]); a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Apr 28 2023 *)

a(n)={my(v=factor(n)[,2]); denominator(n*prod(i=1, #v, my(e=v[i]); binomial(2*e, e)/4^e))} \\ Andrew Howroyd, Aug 09 2018

A299150(n) = { my(f = factor(n), m=1); for(i=1, #f~, m *= 2^(((1+(f[i,1]%2))*f[i,2]) - hammingweight(f[i,2]))); (m); }; \\ Antti Karttunen, Sep 03 2018

for(n=1, 100, print1(denominator(direuler(p=2, n, 1/(1-p*X)^(1/2))[n]), ", ")) \\ Vaclav Kotesovec, May 08 2025

a(n) = denominator(n*A317848(n)/A165825(n)) = A165825(n)/(A037445(n) * A006519(n)). - Andrew Howroyd, Aug 09 2018
a(n) = A046644(n)/A006519(n). - Andrew Howroyd and Antti Karttunen, Aug 30 2018
From Antti Karttunen, Sep 03 2018: (Start)
a(n) = 2^A318440(n).
Multiplicative with a(2^e) = 2^A011371(e), a(p^e) = 2^A005187(e) for odd primes p.
Multiplicative with a(p^e) = 2^(((1+A000035(p))*e)-A000120(e)) for all primes p.
(End)

Keyword:mult added by Andrew Howroyd, Aug 09 2018

A317934 Multiplicative with a(p^n) = 2^A011371(n); denominators for certain "Dirichlet Square Roots" sequences.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 2, 1, 1, 1, 8, 1, 2, 1, 2, 1, 1, 1, 2, 2, 1, 2, 2, 1, 1, 1, 8, 1, 1, 1, 4, 1, 1, 1, 2, 1, 1, 1, 2, 2, 1, 1, 8, 2, 2, 1, 2, 1, 2, 1, 2, 1, 1, 1, 2, 1, 1, 2, 16, 1, 1, 1, 2, 1, 1, 1, 4, 1, 1, 2, 2, 1, 1, 1, 8, 8, 1, 1, 2, 1, 1, 1, 2, 1, 2, 1, 2, 1, 1, 1, 8, 1, 2, 2, 4, 1, 1, 1, 2, 1

Offset: 1

Antti Karttunen, Aug 12 2018

a(n) is the denominator of certain rational valued sequences f(n), that have been defined as f(n) = (1/2) * (b(n) - Sum_{d|n, d>1, dA034444 and A037445.
Many of the same observations as given in A046644 apply also here. Note that A011371 shares with A005187 the property that A011371(x+y) <= A011371(x) + A011371(y), with equivalence attained only when A004198(x,y) = 0, and also the property that A011371(2^(k+1)) = 1 + 2*A011371(2^k).
The following list gives such pairs num(n), b(n) for which b(n) is Dirichlet convolution of num(n)/a(n).
  Numerators   Dirichlet convolution of numerator(n)/a(n) yields
  -------      -----------
  A317933      A034444
  A317941      A037445
  A317940      A046644
Expansion of Dirichlet g.f. Product_{prime} 1/(1 - 2/p^s)^(1/2) is A046643/A317934. - Vaclav Kotesovec, May 08 2025

Antti Karttunen, Table of n, a(n) for n = 1..65537
Vaclav Kotesovec, Graph - the asymptotic ratio (1000000 terms)
Wikipedia, Dirichlet convolution

Cf. A011371, A034444, A317940, A317941, A317946.
Cf. A317933, A317940, A317941 (numerator-sequences).
Cf. also A046644, A299150, A299152, A317832, A317932, A317926 (for denominator sequences of other similar constructions).
Cf. A046643, A167864, A347195.

A011371(n) = (n - hammingweight(n));
A317934(n) = factorback(apply(e -> 2^A011371(e),factor(n)[,2]));

for(n=1, 100, print1(denominator(direuler(p=2, n, 1/(1-2*X)^(1/2))[n]), ", ")) \\ Vaclav Kotesovec, May 07 2025

for(n=1, 100, print1(denominator(direuler(p=2, n, ((1+X)/(1-X))^(1/2))[n]), ", ")) \\ Vaclav Kotesovec, May 09 2025

a(n) = 2^A317946(n).
a(n) = denominator of f(n), where f(1) = 1, f(n) = (1/2) * (b(n) - Sum_{d|n, d>1, d 1, where b is A034444, A037445 or A046644 for example.
Sum_{k=1..n} A046643(k)/a(k) ~ n * sqrt(A167864*log(n)/(Pi*log(2))) * (1 + (4*(gamma - 1) + 5*log(2) - 4*A347195)/(8*log(n))), where gamma is the Euler-Mascheroni constant A001620. - Vaclav Kotesovec, May 08 2025

A318314 Denominators of the sequence whose Dirichlet convolution with itself yields A068068, number of odd unitary divisors of n.

Original entry on oeis.org

1, 2, 1, 8, 1, 2, 1, 16, 2, 2, 1, 8, 1, 2, 1, 128, 1, 4, 1, 8, 1, 2, 1, 16, 2, 2, 2, 8, 1, 2, 1, 256, 1, 2, 1, 16, 1, 2, 1, 16, 1, 2, 1, 8, 2, 2, 1, 128, 2, 4, 1, 8, 1, 4, 1, 16, 1, 2, 1, 8, 1, 2, 2, 1024, 1, 2, 1, 8, 1, 2, 1, 32, 1, 2, 2, 8, 1, 2, 1, 128, 8, 2, 1, 8, 1, 2, 1, 16, 1, 4, 1, 8, 1, 2, 1, 256, 1, 4, 2, 16, 1, 2, 1, 16, 1

Offset: 1

Antti Karttunen and Andrew Howroyd, Aug 29 2018

The sequence seems to give the denominators of several other similarly constructed "Dirichlet Square Roots".

Note that A318314 differs from A318454 at exactly those n where A001227 differs from A068068, the numbers in A038838. - Antti Karttunen, Sep 07 2018

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A005187, A011371, A068068, A318313 (numerators), A318315.

Cf. also A006519, A046644, A299150, A317932, A317934, A317940, A318454, A318662.

a35[n_] := (1 - (-1)^n)/2;
a120[n_] := DigitCount[n, 2, 1];
a[n_] := Product[{p, e} = pe; 2^(((2 - a35[p])*e) - a120[e]), {pe, FactorInteger[n]}];
a /@ Range[100] (* Jean-François Alcover, Sep 19 2019 *)

up_to = 16384;
A068068(n) = (2^omega(n>>valuation(n, 2))); \\ From A068068
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&&dA317937.
v318313_15 = DirSqrt(vector(up_to, n, A068068(n)));
A318313(n) = numerator(v318313_15[n]);
A318314(n) = denominator(v318313_15[n]);

a(n) = denominator of f(n), where f(1) = 1, f(n) = (1/2) * (A068068(n) - Sum_{d|n, d>1, d 1.
a(n) = 2^A318315(n).
From Antti Karttunen, Sep 03-07 2018: (Start, conjectured formulas)
a(n) = A006519(n) * A317934(n), thus multiplicative with a(2^e) = 2^A005187(e), a(p^e) = 2^A011371(e) for odd primes p.
Equally, multiplicative with a(p^e) = 2^(((2-A000035(p))*e)-A000120(e)) for all primes p.
(End)

A317930 Numerators of rational valued sequence whose Dirichlet convolution with itself yields A234840, which is a multiplicative permutation of natural numbers.

Original entry on oeis.org

1, 3, 1, 27, 19, 3, 61, 135, 3, 57, 11, 27, 281, 183, 19, 2835, 101, 9, 5, 513, 61, 33, 263, 135, 1083, 843, 5, 1647, 29, 57, 59, 15309, 11, 303, 1159, 81, 1811, 15, 281, 2565, 1091, 183, 157, 297, 57, 789, 409, 2835, 11163, 3249, 101, 7587, 541, 15, 209, 8235, 5, 87, 31, 513, 7, 177, 183, 168399, 5339, 33, 1013, 2727

Offset: 1

Antti Karttunen, Aug 23 2018

Multiplicative because A234840 is.

Question: Are all terms positive? No negative terms in range 1 .. 2^17. Also (checked for n <= 2^17) the denominators seem to be given by A317932.

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A234840, A317932 (seems to give denominators, see A261179).

Cf. also A317929.

up_to = 16384;
A234840(n) = if(n<=1,n,my(f = factor(n)); for(i=1, #f~, if(2==f[i,1], f[i,1]++, if(3==f[i,1], f[i,1]--, f[i,1] = prime(-1+A234840(1+primepi(f[i,1])))))); factorback(f)); \\ Antti Karttunen, Aug 23 2018
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&&dA317937.
v317930aux = DirSqrt(vector(up_to, n, A234840(n)));
A317930(n) = numerator(v317930aux[n]);

a(n) = numerator of f(n), where f(1) = 1, f(n) = (1/2) * (A234840(n) - Sum_{d|n, d>1, d 1.

A318662 Denominators of the sequence whose Dirichlet convolution with itself yields A055653, sum of phi(d) over all unitary divisors d of n.

Original entry on oeis.org

1, 1, 2, 1, 2, 2, 2, 2, 8, 2, 2, 2, 2, 2, 4, 2, 2, 8, 2, 2, 4, 2, 2, 4, 8, 2, 16, 2, 2, 4, 2, 2, 4, 2, 4, 8, 2, 2, 4, 4, 2, 4, 2, 2, 16, 2, 2, 4, 8, 8, 4, 2, 2, 16, 4, 4, 4, 2, 2, 4, 2, 2, 16, 8, 4, 4, 2, 2, 4, 4, 2, 16, 2, 2, 16, 2, 4, 4, 2, 4, 128, 2, 2, 4, 4, 2, 4, 4, 2, 16, 4, 2, 4, 2, 4, 4, 2, 8, 16, 8, 2, 4, 2, 4, 8

Offset: 1

Antti Karttunen, Sep 03 2018

The sequence seems to give the denominators of several other similarly constructed "Dirichlet Square Roots".

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A055653, A318661 (numerators), A318663.

Cf. also A046644, A299150, A317932, A317934, A318314.

up_to = 1+(2^16);
A055653(n) = sumdiv(n, d, if(gcd(n/d, d)==1, eulerphi(d))); \\ From A055653
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&&dA055653(n)));
A318661(n) = numerator(v318661_62[n]);
A318662(n) = denominator(v318661_62[n]);
A318663(n) = valuation(A318662(n),2);

for(n=1, 100, print1(denominator(direuler(p=2, n, ((1 + X^2 - p*X^2 - X)/((1-X)*(1-p*X)))^(1/2))[n]), ", ")) \\ Vaclav Kotesovec, May 10 2025

a(n) = denominator of f(n), where f(1) = 1, f(n) = (1/2) * (A055653(n) - Sum_{d|n, d>1, d 1.

A318672 Denominators of the sequence whose Dirichlet convolution with itself yields A049599, number of (1+e)-divisors of n.

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 1

Offset: 1

Antti Karttunen, Sep 03 2018

The sequence seems to give the denominators of a few other similarly constructed rational valued sequences obtained as "Dirichlet Square Roots" (possibly of A282446 and A318469).

Antti Karttunen, Table of n, a(n) for n = 1..16385

Cf. A049599, A318671 (numerators), A318673.

Cf. also A046644, A299150, A317932, A317934, A318498.

up_to = (2^16)+1;
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&&dA049599(n) = factorback(apply(e -> (1+numdiv(e)),factor(n)[,2]));
v318671_62 = DirSqrt(vector(up_to, n, A049599(n)));
A318671(n) = numerator(v318671_62[n]);
A318672(n) = denominator(v318671_62[n]);
A318673(n) = valuation(A318672(n),2);

a(n) = denominator of f(n), where f(1) = 1, f(n) = (1/2) * (A049599(n) - Sum_{d|n, d>1, d 1.

a(n) = 2^A318673(n).

A317928 Denominators of rational valued sequence whose Dirichlet convolution with itself yields A005187.

Original entry on oeis.org

1, 2, 1, 8, 1, 1, 2, 16, 1, 1, 2, 4, 2, 4, 1, 128, 1, 1, 2, 1, 2, 4, 1, 2, 2, 4, 1, 16, 1, 2, 2, 256, 1, 1, 2, 4, 2, 4, 1, 8, 2, 4, 1, 16, 1, 2, 2, 64, 8, 4, 1, 16, 1, 2, 2, 32, 1, 2, 2, 8, 2, 4, 1, 1024, 1, 1, 2, 2, 2, 4, 1, 1, 2, 4, 1, 16, 4, 2, 2, 32, 2, 4, 1, 16, 1, 2, 2, 32, 1, 2, 4, 8, 2, 4, 1, 64, 2, 16, 1, 16, 1, 2, 2, 32, 2

Offset: 1

Antti Karttunen, Aug 11 2018

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A005187, A317927 (numerators).

Cf. also A297111, A300244, A299152, A317932.

6
A005187(n) = { my(s=n); while(n>>=1, s+=n); s; };
A317927perA317928(n) = if(1==n,n,(A005187(n)-sumdiv(n,d,if((d>1)&&(dA317927perA317928(d)*A317927perA317928(n/d),0)))/2);
A317928(n) = denominator(A317927perA317928(n));

a(n) = denominator of f(n), where f(1) = 1, f(n) = (1/2) * (A005187(n) - Sum_{d|n, d>1, d 1.

A318319 Numerators of rational valued sequence whose Dirichlet convolution with itself yields A064989.

Original entry on oeis.org

1, 1, 1, 3, 3, 1, 5, 5, 3, 3, 7, 3, 11, 5, 3, 35, 13, 3, 17, 9, 5, 7, 19, 5, 27, 11, 5, 15, 23, 3, 29, 63, 7, 13, 15, 9, 31, 17, 11, 15, 37, 5, 41, 21, 9, 19, 43, 35, 75, 27, 13, 33, 47, 5, 21, 25, 17, 23, 53, 9, 59, 29, 15, 231, 33, 7, 61, 39, 19, 15, 67, 15, 71, 31, 27, 51, 35, 11, 73, 105, 35, 37, 79, 15, 39, 41, 23, 35, 83, 9, 55, 57

Offset: 1

Antti Karttunen, Aug 24 2018

Multiplicative because A064989 is.

No negative terms among the first 2^20 terms.

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences computed from indices in prime factorization

Cf. A064989, A317932 (seems to give denominators, see A261179).

Cf. also A318321.

up_to = 16384;
A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
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&&dA317937.
v318319aux = DirSqrt(vector(up_to, n, A064989(n)));
A318319(n) = numerator(v318319aux[n]);

a(n) = numerator of f(n), where f(1) = 1, f(n) = (1/2) * (A064989(n) - Sum_{d|n, d>1, d 1.

Showing 1-10 of 13 results. Next

cp's OEIS Frontend

A305439 a(n) = A046645(n) - A007949(n); the 2-adic valuation of A317932.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A046644 From square root of Riemann zeta function: form Dirichlet series Sum b_n/n^s whose square is zeta function; sequence gives denominator of b_n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Scheme

Formula

A299150 Denominators of the positive solution to n = Sum_{d|n} a(d) * a(n/d).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Mathematica

PARI

PARI

PARI

Formula

Extensions

A317934 Multiplicative with a(p^n) = 2^A011371(n); denominators for certain "Dirichlet Square Roots" sequences.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

PARI

PARI

Formula

A318314 Denominators of the sequence whose Dirichlet convolution with itself yields A068068, number of odd unitary divisors of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A317930 Numerators of rational valued sequence whose Dirichlet convolution with itself yields A234840, which is a multiplicative permutation of natural numbers.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

PARI

Formula

A318662 Denominators of the sequence whose Dirichlet convolution with itself yields A055653, sum of phi(d) over all unitary divisors d of n.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs