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

A372619 Square array T(n,k), n >= 1, k >= 1, read by antidiagonals downwards, where T(n,k) = 1/(phi(k)) * Sum_{j=1..n} phi(k*j).

Original entry on oeis.org

1, 1, 2, 1, 3, 4, 1, 2, 5, 6, 1, 3, 5, 9, 10, 1, 2, 5, 7, 13, 12, 1, 3, 4, 9, 11, 17, 18, 1, 2, 6, 6, 13, 14, 23, 22, 1, 3, 4, 10, 11, 17, 20, 31, 28, 1, 2, 5, 6, 14, 13, 23, 24, 37, 32, 1, 3, 5, 9, 10, 20, 19, 31, 33, 45, 42, 1, 2, 5, 7, 13, 12, 26, 23, 37, 37, 55, 46
Offset: 1

Views

Author

Seiichi Manyama, May 07 2024

Keywords

Examples

			Square array T(n,k) begins:
   1,  1,  1,  1,  1,  1,  1,  1,  1,  1, ...
   2,  3,  2,  3,  2,  3,  2,  3,  2,  3, ...
   4,  5,  5,  5,  4,  6,  4,  5,  5,  5, ...
   6,  9,  7,  9,  6, 10,  6,  9,  7,  9, ...
  10, 13, 11, 13, 11, 14, 10, 13, 11, 14, ...
  12, 17, 14, 17, 13, 20, 12, 17, 14, 18, ...
  18, 23, 20, 23, 19, 26, 19, 23, 20, 24, ...
		

Crossrefs

Main diagonal gives A070639.

Programs

  • Mathematica
    T[n_, k_] := Sum[EulerPhi[k*j], {j, 1, n}] / EulerPhi[k]; Table[T[k, n-k+1], {n, 1, 12}, {k, 1, n}] // Flatten (* Amiram Eldar, May 09 2024 *)
  • PARI
    T(n, k) = sum(j=1, n, eulerphi(k*j))/eulerphi(k);

Formula

T(n,k) ~ (3/Pi^2) * c(k) * n^2, where c(k) = A078615(k)/A322360(k) is the multiplicative function defined by c(p^e) = p^2/(p^2-1). - Amiram Eldar, May 09 2024

A194881 A number of sum-free sets related to fractional parts of multiples of a rational number in the range 1/3 to 2/3.

Original entry on oeis.org

2, 3, 6, 8, 12, 15, 21, 25, 34, 38, 48, 54, 66, 72, 84, 92, 108, 117, 135, 143, 161, 171, 193, 205, 225, 237, 264, 276, 304, 316, 346, 362, 392, 408, 432, 450, 486, 504, 540, 556, 596, 614, 656, 676, 712, 734, 780, 804, 846
Offset: 1

Views

Author

R. J. Mathar, Sep 04 2011

Keywords

Comments

Deserves a better title which mentions n in the sense that this is a sum-free set from a difference set with {1,....,n}.

Crossrefs

Programs

  • Maple
    A194881 := proc(n) 1+add(numtheory[phi](3*q),q=1..n)/2 ; end proc:
    seq(A194881(n),n=1..80) ;
  • Mathematica
    Accumulate[Table[EulerPhi[3*n], {n, 1, 60}]]/2 + 1 (* Amiram Eldar, May 08 2024 *)

Formula

a(n) = 1 + Sum_{j=1..n} A000010(3*j)/2.
a(n) ~ (27/(8*Pi^2)) * n^2. - Amiram Eldar, May 08 2024
Showing 1-2 of 2 results.