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.

A282600 a(n) = Sum_(k=1..phi(n)) floor(d_k/2) where d_k are the totatives of n.

Original entry on oeis.org

0, 0, 1, 1, 4, 2, 9, 6, 12, 8, 25, 10, 36, 18, 28, 28, 64, 24, 81, 36, 60, 50, 121, 44, 120, 72, 117, 78, 196, 56, 225, 120, 160, 128, 204, 102, 324, 162, 228, 152, 400, 120, 441, 210, 264, 242, 529, 184, 504, 240, 400, 300, 676, 234, 540, 324, 504, 392, 841, 232
Offset: 1

Views

Author

Michel Marcus, Feb 19 2017

Keywords

Comments

The totatives of n are the numbers k <= n with gcd(k,n) = 1.

Crossrefs

Programs

  • PARI
    a(n) = sum(k=1, n, (k\2)*(gcd(n, k)==1));

Formula

If n is odd, a(n) = A023896(n)/2 - A000010(n)/4;
If n is even, a(n) = A023896(n)/2 - A000010(n)/2.