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.

A106476 Sequence array of Euler phi function.

Original entry on oeis.org

1, 1, 1, 2, 1, 1, 2, 2, 1, 1, 4, 2, 2, 1, 1, 2, 4, 2, 2, 1, 1, 6, 2, 4, 2, 2, 1, 1, 4, 6, 2, 4, 2, 2, 1, 1, 6, 4, 6, 2, 4, 2, 2, 1, 1, 4, 6, 4, 6, 2, 4, 2, 2, 1, 1, 10, 4, 6, 4, 6, 2, 4, 2, 2, 1, 1, 4, 10, 4, 6, 4, 6, 2, 4, 2, 2, 1, 1, 12, 4, 10, 4, 6, 4, 6, 2, 4, 2, 2, 1, 1, 6, 12, 4, 10, 4, 6, 4, 6, 2, 4, 2, 2, 1, 1
Offset: 0

Views

Author

Paul Barry, May 03 2005

Keywords

Comments

Row sums are A002088(n+1). Diagonal sums are A106477. Riordan array (1/Sum_{j>=0} A106479(j)*x^j, x).

Examples

			Triangle begins:
  1;
  1,1;
  2,1,1;
  2,2,1,1;
  4,2,2,1,1;
  2,4,2,2,1,1;
		

Crossrefs

Programs

  • Mathematica
    T[n_, k_] := If[k <= n, EulerPhi[n - k + 1], 0]; Table[T[n, k], {n, 0, 13}, {k, 0, n}] // Flatten (* Amiram Eldar, Nov 16 2024 *)

Formula

Triangle T(n, k) = if(k <= n, phi(n-k+1), 0).