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.

A069513 Characteristic function of the prime powers p^k, k >= 1.

Original entry on oeis.org

0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0
Offset: 1

Views

Author

Benoit Cloitre, Apr 15 2002

Keywords

Comments

Also, number of Galois fields of order n. - Charles R Greathouse IV, Mar 12 2008
Also, number of abelian indecomposable groups of order n. - Kevin Lamoreau, Mar 13 2023

Crossrefs

The partial sums of this sequence give A025528. - Daniel Forgues, Mar 02 2009

Programs

Formula

If n >= 2, a(n) = A010055(n).
a(n) = Sum_{d|n} bigomega(d)*mu(n/d); equivalently, Sum_{d|n} a(d) = bigomega(n); equivalently, Möbius transform of bigomega(n).
Dirichlet g.f.: ppzeta(s). Here ppzeta(s) = Sum_{p prime} Sum_{k>=1} 1/(p^k)^s. Note that ppzeta(s) = Sum_{p prime} 1/(p^s - 1) = Sum_{k>=1} primezeta(k*s). - Franklin T. Adams-Watters, Sep 11 2005
a(n) = floor(1/A001221(n)), for n > 1. - Enrique Pérez Herrero, Jun 01 2011
a(n) = - Sum_{d|n} mu(d)*bigomega(d), where bigomega = A001222. - Ridouane Oudra, Oct 29 2024
a(n) = - Sum_{d|n} mu(d)*omega(d), where omega = A001221. - Ridouane Oudra, Jul 30 2025

Extensions

Moved original definition to formula line. Used comment (that I previously added) as definition. - Daniel Forgues, Mar 08 2009
Edited by Franklin T. Adams-Watters, Nov 02 2009