OFFSET
1,4
COMMENTS
a(n) is the number of automorphisms on the field with order A000961(n). This group of automorphisms is cyclic of order a(n). - Geoffrey Critzer, Feb 23 2018
LINKS
Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
FORMULA
MATHEMATICA
Prepend[Table[ FactorInteger[q][[1, 2]], {q,
Select[Range[1, 1000], PrimeNu[#] == 1 &]}], 0] (* Geoffrey Critzer, Feb 23 2018 *)
PROG
(Haskell)
a025474 = a001222 . a000961 -- Reinhard Zumkeller, Aug 13 2013
(Python)
from sympy import prime, integer_nthroot, factorint
def A025474(n):
if n == 1: return 0
def f(x): return int(n+x-1-sum(primepi(integer_nthroot(x, k)[0]) for k in range(1, x.bit_length())))
m, k = n, f(n)
while m != k:
m, k = k, f(k)
return list(factorint(m).values())[0] # Chai Wah Wu, Aug 15 2024
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
EXTENSIONS
Edited by M. F. Hasler, Jun 16 2022
STATUS
approved