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

A369291 Array read by antidiagonals: T(n,k) = phi(k^n-1)/n, where phi is Euler's totient function (A000010), n >= 1, k >= 2.

Original entry on oeis.org

1, 1, 1, 2, 2, 2, 2, 4, 4, 2, 4, 4, 12, 8, 6, 2, 12, 20, 32, 22, 6, 6, 8, 56, 48, 120, 48, 18, 4, 18, 36, 216, 280, 288, 156, 16, 6, 16, 144, 160, 1240, 720, 1512, 320, 48, 4, 30, 96, 432, 1120, 5040, 5580, 4096, 1008, 60, 10, 16, 216, 640, 5400, 6048, 31992, 14976, 15552, 2640, 176
Offset: 1

Views

Author

Andrew Howroyd, Jan 28 2024

Keywords

Comments

For k a prime power, T(n,k) is the number of primitive polynomials of degree n over GF(k). See A011260, A027385 for additional information.

Examples

			Array begins:
n\k|  2   3    4     5      6      7      8       9 ...
---+---------------------------------------------------
 1 |  1   1    2     2      4      2      6       4 ...
 2 |  1   2    4     4     12      8     18      16 ...
 3 |  2   4   12    20     56     36    144      96 ...
 4 |  2   8   32    48    216    160    432     640 ...
 5 |  6  22  120   280   1240   1120   5400    5280 ...
 6 |  6  48  288   720   5040   6048  23328   27648 ...
 7 | 18 156 1512  5580  31992  37856 254016  340704 ...
 8 | 16 320 4096 14976 139968 192000 829440 1966080 ...
  ...
		

Crossrefs

Rows n=1..3 and 5 are A000010(k-1), A319210, A319213, A319214.
Cf. A319183.

Programs

  • Mathematica
    A369291[n_, k_] := EulerPhi[k^n - 1]/n;
    Table[A369291[k, n-k+2], {n, 15}, {k, n}] (* Paolo Xausa, Jun 17 2024 *)
  • PARI
    T(n,k) = eulerphi(k^n-1)/n

A319213 a(n) = phi(n^3 - 1)/3 where phi is A000010.

Original entry on oeis.org

2, 4, 12, 20, 56, 36, 144, 96, 216, 144, 520, 240, 840, 480, 576, 816, 1568, 756, 2520, 1232, 1872, 1560, 4400, 1440, 4320, 3024, 4860, 3168, 7056, 2640, 9000, 5984, 7920, 6144, 10080, 4752, 17784, 7992, 13104, 9184, 22080, 7560, 23688, 12960, 14688, 15840, 33120
Offset: 2

Views

Author

Seiichi Manyama, Sep 13 2018

Keywords

Crossrefs

Row 3 of A369291.
Cf. A000010, A068601 (n^3-1).
phi(n^b - 1)/b: A319210 (b=2), this sequence (b=3), A319214 (b=5).

Programs

  • Mathematica
    EulerPhi[Range[2, 50]^3 - 1]/3 (* Paolo Xausa, Jun 18 2024 *)
  • PARI
    {a(n) = eulerphi(n^3-1)/3}

Formula

Sum_{k=1..n} a(k) = c * n^4 + O((n*log(n))^3), where c = (2/27) * Product_{p prime == 1 (mod 3)} (1 - 3/p^2) * Product_{p prime == 2 (mod 3)} (1 - 1/p^2) = 0.047313356295... . - Amiram Eldar, Dec 09 2024

A319210 a(n) = phi(n^2 - 1)/2 where phi is A000010.

Original entry on oeis.org

1, 2, 4, 4, 12, 8, 18, 16, 30, 16, 60, 24, 48, 48, 64, 48, 144, 48, 108, 80, 132, 80, 220, 96, 180, 144, 252, 96, 420, 128, 300, 256, 240, 192, 432, 216, 432, 288, 480, 192, 840, 240, 504, 440, 552, 352, 966, 320, 672, 480, 832, 432, 1040, 432, 720, 672, 1044, 448
Offset: 2

Views

Author

Seiichi Manyama, Sep 13 2018

Keywords

Crossrefs

Row 2 of A369291.
Cf. A000010, A005563 (n^2-1, shifted), A065474.
phi(n^b - 1)/b: this sequence (b=2), A319213 (b=3), A319214 (b=5).

Programs

  • Magma
    [EulerPhi(n^2-1)/2: n in [2..70]]; // Vincenzo Librandi, Sep 15 2018
  • Mathematica
    Table[(EulerPhi@(n^2 - 1) / 2), {n, 2, 70}] (* Vincenzo Librandi, Sep 15 2018 *)
  • PARI
    {a(n) = eulerphi(n^2-1)/2}
    

Formula

Sum_{k=1..n} a(k) = c * n^3 / 4 + O((n*log(n))^2), where c = Product_{p prime} (1 - 2/p^2) = 0.322634... (A065474). - Amiram Eldar, Dec 09 2024
Showing 1-3 of 3 results.