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.

A304819 Dirichlet convolution of r with zeta, where r(n) = (-1)^Omega(n) if n is 1 or not a perfect power and r(n) = 0 otherwise.

Original entry on oeis.org

1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, -1, 0, -1, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, -2, 0, 0, 0, 0, 0, 0, 0, -1, -1, 0, 0, -1, 0, -1, 0, -1, 0, 0, 0, 0, 0, 0, 0, -1, 0, 0, -1, 0, 0, 0, 0, -1, 0, 0, 0, -2, 0, 0, -1, -1, 0, 0, 0, -1, 0
Offset: 1

Views

Author

Gus Wiseman, May 19 2018

Keywords

Comments

Omega(n) = A001222(n) is the number of prime factors of n counted with multiplicity.

Crossrefs

Positions of nonzero entries appear to be A126706.

Programs

  • Mathematica
    Table[Sum[(-1)^PrimeOmega[d],{d,Select[Divisors[n],GCD@@FactorInteger[#][[All,2]]==1&]}],{n,100}]
  • PARI
    A304819(n) = sumdiv(n,d,if(!ispower(d),(-1)^bigomega(d),0)); \\ Antti Karttunen, Jul 29 2018

Formula

a(n) = Sum_{d|n, d = 1 or not a perfect power} (-1)^Omega(d).