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.

A347946 Products of nonprimitive roots of n, or 0 if n = 2 or has no primitive roots.

Original entry on oeis.org

0, 0, 1, 2, 4, 24, 48, 0, 4032, 17280, 5400, 0, 518400, 415134720, 0, 0, 1797120, 6467044147200, 39086530560, 0, 0, 1738201006080000, 10247897088, 0, 9632530575360000, 706822057112371200000, 569299069913333760000, 0, 54538738974720000, 0
Offset: 1

Views

Author

Davide Rotondo, Sep 26 2021

Keywords

Comments

If n is a prime p, a(n) == -1 (mod p) for n > 3; if n is a composite c, a(n) == 0 (mod c) for n > 4.

Examples

			a(11) = 5400 because the primitive roots of 11 are {2,6,7,8} and therefore the nonprimitive roots of 11 are {1,3,4,5,9,10} and 1*3*4*5*9*10 = 5400.
		

Crossrefs

Programs

  • Mathematica
    a[n_] := If[n == 2 || (p = PrimitiveRootList[n]) == {}, 0, (n - 1)!/Times @@ p]; Array[a, 30] (* Amiram Eldar, Sep 26 2021 *)