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.

A318498 Denominators of the sequence whose Dirichlet convolution with itself yields A061389, number of (1+phi)-divisors of n.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 8, 1, 2, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 8, 1, 1, 1, 4, 1, 1, 1, 1, 1, 1, 1, 2, 2, 1, 1, 8, 2, 2, 1, 2, 1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 2, 16, 1, 1, 1, 2, 1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 1, 8, 8, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 2, 1, 1, 1, 8, 1, 2, 2, 4, 1, 1, 1, 1, 1
Offset: 1

Views

Author

Antti Karttunen, Aug 30 2018

Keywords

Comments

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

Crossrefs

Cf. A061389, A318497 (numerators), A318499.
Cf. also A299150, A046644.

Programs

  • PARI
    up_to = 65537;
    A061389(n) = factorback(apply(e -> (1+eulerphi(e)),factor(n)[,2]));
    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.
    v318497_98 = DirSqrt(vector(up_to, n, A061389(n)));
    A318497(n) = numerator(v318497_98[n]);
    A318498(n) = denominator(v318497_98[n]);

Formula

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