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.

A319166 Number of primitive polynomials of degree n over GF(11).

Original entry on oeis.org

4, 16, 144, 960, 12880, 62208, 1087632, 7027200, 85098816, 691398400, 10374307328, 49985372160, 1061265441600, 7064952935040, 90426613939200, 708867057254400, 11892871258806912, 65078340559220736, 1287559798913990448, 8819554320783360000, 111715065087913437696
Offset: 1

Views

Author

Seiichi Manyama, Sep 12 2018

Keywords

Crossrefs

Column k=11 of A369291.
phi(k^n-1)/n: A011260 (k=2), A027385 (k=3), A027695 (k=4), A027741 (k=5), A295496 (k=6), A027743 (k=7), A027744 (k=8), A027745 (k=9), A295497 (k=10), this sequence (k=11).
Cf. A000010.

Programs

  • Mathematica
    Array[EulerPhi[11^# - 1]/# &, 25] (* Paolo Xausa, Jun 17 2024 *)
  • PARI
    {a(n) = eulerphi(11^n-1)/n}

Formula

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