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.

A064450 Sum of totients of binomial coefficients C(n,j), j=0..n.

Original entry on oeis.org

1, 2, 3, 6, 8, 18, 30, 86, 106, 158, 290, 662, 1410, 3674, 7166, 16242, 20242, 46754, 72910, 162686, 304866, 524570, 1179430, 2842710, 5230210, 11035402, 24478394, 40473686, 63927602, 155016682, 328928338, 888801182, 928681474, 1765045802
Offset: 0

Views

Author

Labos Elemer, Oct 02 2001

Keywords

Comments

a(n) = sum of n-th row of the triangle formed by replacing each m in Pascal's triangle by phi(m). See A102715.

Examples

			For n=4, the binomial coefficients C(4,j) are 1, 4, 6, 4, and 1. The totients are 1, 2, 2, 2, and 1.  So a(4) = 1 + 2 + 2 + 2 + 1 = 8. - _Michael B. Porter_, Jun 25 2018
		

Crossrefs

Programs

  • Mathematica
    a(n)=Apply[Plus, Table[EulerPhi[Binomial[n, w]], {w, 0, n}]],
  • PARI
    a(n) = vecsum(vector(n+1, k, eulerphi(binomial(n, k-1)))); \\ Michel Marcus, Jun 24 2018
Showing 1-1 of 1 results.