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-4 of 4 results.

A106477 Diagonal sums of Euler phi function sequence array.

Original entry on oeis.org

1, 1, 3, 3, 7, 5, 13, 9, 19, 13, 29, 17, 41, 23, 49, 31, 65, 37, 83, 45, 95, 55, 117, 63, 137, 75, 155, 87, 183, 95, 213, 111, 233, 127, 257, 139, 293, 157, 317, 173, 357, 185, 399, 205, 423, 227, 469, 243, 511, 263, 543, 287, 595, 305, 635, 329, 671, 357, 729, 373
Offset: 0

Views

Author

Paul Barry, May 03 2005

Keywords

Comments

Diagonal sums of A106476.

Crossrefs

Programs

  • Mathematica
    a[n_] := Sum[EulerPhi[n - 2*k + 1], {k, 0, Floor[n/2]}]; Array[a, 60, 0] (* Amiram Eldar, Nov 16 2024 *)

Formula

a(n) = Sum{k=0..floor(n/2)} phi(n-2k+1).

A106479 First column in inverse of Euler phi sequence matrix.

Original entry on oeis.org

1, -1, -1, 1, -1, 3, -3, -1, 7, -9, 5, -1, -7, 25, -27, -3, 29, -41, 55, -25, -73, 161, -143, -11, 217, -387, 447, -99, -737, 1377, -1219, 209, 1761, -3999, 4357, -1087, -5311, 11463, -12475, 4723, 12705, -33133, 38839, -15005, -35001, 90485, -112395, 54269, 92435, -262555, 328759, -165839, -244533
Offset: 0

Views

Author

Paul Barry, May 03 2005

Keywords

Crossrefs

Programs

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

Formula

G.f.: 1/Sum_{k>=0} phi(k+1)*x^k.

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).

A106478 Inverse of sequence array for Euler phi function.

Original entry on oeis.org

1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, 1, -1, -1, 1, 3, -1, 1, -1, -1, 1, -3, 3, -1, 1, -1, -1, 1, -1, -3, 3, -1, 1, -1, -1, 1, 7, -1, -3, 3, -1, 1, -1, -1, 1, -9, 7, -1, -3, 3, -1, 1, -1, -1, 1, 5, -9, 7, -1, -3, 3, -1, 1, -1, -1, 1, -1, 5, -9, 7, -1, -3, 3, -1, 1, -1, -1, 1, -7, -1, 5, -9, 7, -1, -3, 3, -1, 1, -1, -1, 1, 25, -7, -1, 5, -9, 7, -1, -3, 3, -1, 1, -1, -1, 1
Offset: 0

Views

Author

Paul Barry, May 03 2005

Keywords

Comments

Row sums are A106480. Sequence matrix for A106479.

Examples

			Triangle begins:
   1;
  -1,  1;
   1, -1, -1,  1;
  -1,  1, -1, -1,  1;
   3, -1,  1, -1, -1,  1;
  -3,  3, -1,  1, -1, -1,  1;
  -1, -3,  3, -1,  1, -1, -1, 1;
   ...
		

Crossrefs

Programs

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

Formula

Riordan array (1/Sum_{j>=0}, phi(j+1) x^j, x).
Showing 1-4 of 4 results.