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.

A062004 a(n) = 2*n*mu(n).

Original entry on oeis.org

2, -4, -6, 0, -10, 12, -14, 0, 0, 20, -22, 0, -26, 28, 30, 0, -34, 0, -38, 0, 42, 44, -46, 0, 0, 52, 0, 0, -58, -60, -62, 0, 66, 68, 70, 0, -74, 76, 78, 0, -82, -84, -86, 0, 0, 92, -94, 0, 0, 0, 102, 0, -106, 0, 110, 0, 114, 116, -118, 0, -122, 124, 0, 0, 130, -132, -134, 0, 138, -140, -142, 0, -146, 148, 0, 0, 154, -156, -158, 0
Offset: 1

Views

Author

Jason Earls, Jul 04 2001

Keywords

Comments

a(n)/2 is multiplicative because both mu(n) and n are. - Mitch Harris, Jun 09 2005
b(n) = a(n)/a(1) is multiplicative with b(p^1) = -p, b(p^e) = 0 if e > 1. - David W. Wilson, Jun 12 2005

Crossrefs

Programs

  • Magma
    [2*n*MoebiusMu(n) : n in [1..100]]; // G. C. Greubel, May 03 2022
    
  • Mathematica
    Table[MoebiusMu[n]2n,{n,100}] (* Harvey P. Dale, May 11 2011 *)
  • SageMath
    [2*n*moebius(n) for n in (1..100)] # G. C. Greubel, May 03 2022

Formula

a(n) = 2*A055615(n). - Michel Marcus, May 03 2022