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.

A218258 a(n) = |{m : multiplicative order of n mod m = 9}|.

Original entry on oeis.org

0, 2, 4, 26, 18, 12, 52, 4, 112, 12, 16, 12, 30, 12, 24, 488, 30, 24, 64, 4, 12, 78, 48, 28, 464, 12, 56, 62, 72, 12, 104, 56, 36, 52, 48, 112, 432, 28, 48, 52, 48, 24, 488, 56, 72, 288, 48, 24, 580, 6, 24, 116, 360, 44, 344, 16, 48, 104, 24, 8, 312, 44, 112
Offset: 1

Views

Author

Alois P. Heinz, Oct 24 2012

Keywords

Crossrefs

Row n=9 of A212957.

Programs

  • Maple
    with(numtheory):
    a:= n-> add(mobius(9/d) *tau(n^d-1), d={3, 9}):
    seq(a(n), n=1..80);
  • Mathematica
    Table[DivisorSigma[0,n^9-1]-DivisorSigma[0,n^3-1],{n,70}] (* Harvey P. Dale, Mar 15 2018 *)
  • PARI
    a(n) = if(n == 1, 0, numdiv(n^9-1) - numdiv(n^3-1)); \\ Amiram Eldar, Jan 25 2025

Formula

a(n) = tau(n^9-1)-tau(n^3-1), with tau = A000005.