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.

A324913 a(n) = Sum_{k=1..n} 2^k * phi(k), where phi is the Euler totient function A000010.

Original entry on oeis.org

2, 6, 22, 54, 182, 310, 1078, 2102, 5174, 9270, 29750, 46134, 144438, 242742, 504886, 1029174, 3126326, 4699190, 14136374, 22524982, 47690806, 89633846, 274183222, 408400950, 1079489590, 1884795958, 4300715062, 7521940534, 22554326070, 31144260662, 95568770102
Offset: 1

Views

Author

Vaclav Kotesovec, Mar 18 2019

Keywords

Crossrefs

Programs

  • Maple
    ListTools:-PartialSums([seq(2^k * numtheory:-phi(k),k=1..50)]); # Robert Israel, Apr 17 2025
  • Mathematica
    Accumulate[Table[2^k*EulerPhi[k], {k, 1, 40}]]