A337910 Integers of the form (the number of nonnegative bases m < n such that m^3 == m (mod n))/(the number of nonnegative bases m < n such that -m^3 == m (mod n)).

1, 1, 3, 3, 1, 3, 3, 5, 3, 1, 3, 9, 1, 3, 3, 5, 1, 3, 3, 3, 9, 3, 3, 15, 1, 1, 3, 9, 1, 3, 3, 5, 9, 1, 3, 9, 1, 3, 3, 5, 1, 9, 3, 9, 3, 3, 3, 15, 3, 1, 3, 3, 1, 3, 3, 15, 9, 1, 3, 9, 1, 3, 9, 5, 1, 9, 3, 3, 9, 3, 3, 15, 1, 1, 3, 9, 9, 3, 3, 5, 3, 1, 3, 27, 1, 3, 3, 15, 1, 3, 3, 9, 9, 3, 3, 15

Offset: 1

Author

Juri-Stepan Gerasimov, Sep 29 2020

Keywords

• nonn
• easy

Comments

All members of a(n) are odd numbers. For n > 3, 1 <= a(n) < n.

Crossrefs

Cf. A026741, A008784, A002313, A002145, A334006.

Programs

Magma

[#[m: m in [0..n-1] | m^3 mod n eq m]/#[m: m in [0..n-1] | -m^3 mod n eq m]: n in [1..96]];