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.

Showing 1-1 of 1 results.

A160619 a(n) = Sum_{d|n} phi(n/d)*2^(d+1), with a(0) = 0.

Original entry on oeis.org

0, 4, 12, 24, 48, 80, 168, 280, 576, 1080, 2160, 4136, 8448, 16432, 33096, 65760, 131712, 262208, 525672, 1048648, 2099520, 4194960, 8392824, 16777304, 33564096, 67109200, 134234256, 268437672, 536904480, 1073741936, 2147554080, 4294967416, 8590066944
Offset: 0

Views

Author

N. J. A. Sloane, Nov 21 2009

Keywords

Crossrefs

Programs

  • Mathematica
    a[n_]:= If[n<1, 0, Sum[EulerPhi[n/d] 2^(d+1), {d, Divisors[n]}]]; Table[a[n], {n, 0, 50}] (* G. C. Greubel, May 06 2018 *)
  • PARI
    a(n) = if (n==0, 0, sumdiv(n, d, eulerphi(n/d)*2^(d+1))); \\ Michel Marcus, May 07 2018; corrected Jun 14 2022

Formula

a(n) = 4*A034738(n). - Michel Marcus, May 07 2018

Extensions

Name edited by Michel Marcus, Jun 14 2022
Showing 1-1 of 1 results.