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

1, 1, 3, 3, 5, 3, 7, 5, 27, 5, 11, 9, 13, 7, 15, 35, 17, 27, 19, 15, 21, 11, 23, 15, 75, 13, 135, 21, 29, 15, 31, 63, 33, 17, 35, 81, 37, 19, 39, 25, 41, 21, 43, 33, 135, 23, 47, 105, 147, 75, 51, 39, 53, 135, 55, 35, 57, 29, 59, 45, 61, 31, 189, 231, 65, 33

Offset

1,3

Comments

Dirichlet convolution of a(n)/A046644(n) with itself yields A000265. - Antti Karttunen, Aug 30 2018

Links

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

Wikipedia, Dirichlet convolution.

Formula

a(n) = numerator(n*A317848(n)/A165825(n)) = A000265(n*A317848(n)). - Andrew Howroyd, Aug 09 2018

Example

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.

Mathematica

nn=50;
sys=Table[n==Sum[a[d]*a[n/d], {d, Divisors[n]}], {n, nn}];
Numerator[Array[a, nn]/.Solve[sys, Array[a, nn]][[2]]]
odd[n_] := n/2^IntegerExponent[n, 2]; f[p_, e_] := odd[p^e*Binomial[2*e, e]]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Apr 30 2023 *)

Prog

(PARI) a(n)={my(v=factor(n)[, 2]); numerator(n*prod(i=1, #v, my(e=v[i]); binomial(2*e, e)/4^e))} \\ Andrew Howroyd, Aug 09 2018
(PARI) \\ DirSqrt(v) finds u such that v = v[1]*dirmul(u, u).
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}
apply(numerator, DirSqrt(vector(100, n, n))) \\ Andrew Howroyd, Aug 09 2018

Crossrefs

Cf. A000010, A000265, A003958, A007431, A018804, A023900, A029935, A046643, A046644, A165825, A257098, A298971, A299119, A299150 (denominators), A299151, A317848, A318319, A318321, A318649.

Sequence in context: A219793 A215495 A335115 * A096866 A348158 A360469

Adjacent sequences: A299146 A299147 A299148 * A299150 A299151 A299152

Keyword

nonn,frac,mult

Author

Gus Wiseman, Feb 03 2018

Extensions

Keyword:mult added by Andrew Howroyd, Aug 09 2018

Status

approved