OFFSET
1,3
COMMENTS
Trivial upper bound: a(n) <= 2^(phi(n)-1). - Charles R Greathouse IV, Jun 08 2016
Equivalently, the number of subgroups of the multiplicative group of integers modulo n. - Andrew Howroyd, Jul 01 2018
Also a(n) is the number of subfields of the n-th cyclotomic field Q(exp(2*Pi*i/n)). - Jianing Song, Feb 12 2021
LINKS
Keith F. Lynch, Table of n, a(n) for n = 1..1000
ResearchGate, How many subfields does a cyclotomic field have
EXAMPLE
For instance a(30) = 8 because only the following 8 groups exist: {1} {1,11} {1,19} {1,7,13,19} {1,17,19,23} {1,29} {1,11,19,29} {1,7,11,13,17,19,23,29}.
PROG
(GAP) Concatenation([0], List([2..80], n->Sum( ConjugacyClassesSubgroups( LatticeSubgroups( GL(1, ZmodnZ(n)))), Size))); # Andrew Howroyd, Jul 01 2018
CROSSREFS
KEYWORD
nonn
AUTHOR
Keith F. Lynch, May 07 2016
STATUS
approved