login
A318453
Numerators of the sequence whose Dirichlet convolution with itself yields A001227, number of odd divisors of n.
4
1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 35, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 63, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 35, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 231, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 35, 1, 1, 1, 3, 1, 1, 1, 5, 1, 1, 1, 3, 1, 1, 1, 63, 1, 1, 1, 3, 1, 1, 1, 5, 1
OFFSET
1,4
LINKS
FORMULA
a(n) = numerator of f(n), where f(1) = 1, f(n) = (1/2) * (A001227(n) - Sum_{d|n, d>1, d<n} f(d) * f(n/d)) for n > 1.
MATHEMATICA
f[1] = 1; f[n_] := f[n] = 1/2 (Sum[Mod[d, 2], {d, Divisors[n]}] - Sum[f[d] f[n/d], {d, Divisors[n][[2 ;; -2]]}]);
Table[f[n] // Numerator, {n, 1, 105}] (* Jean-François Alcover, Sep 13 2018 *)
PROG
(PARI)
up_to = 16384;
A001227(n) = numdiv(n>>valuation(n, 2)); \\ From A001227
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.
v318453_54 = DirSqrt(vector(up_to, n, A001227(n)));
A318453(n) = numerator(v318453_54[n]);
A318454(n) = denominator(v318453_54[n]);
CROSSREFS
Cf. A001227.
Cf. A318454 (gives the denominators).
Differs from A318313 for the first time at n=81, where a(81) = 1, while A318313(81) = 3.
Sequence in context: A339899 A305803 A243813 * A318313 A101021 A357990
KEYWORD
nonn,frac
AUTHOR
STATUS
approved